arxiv: 2605.12030 · v2 · submitted 2026-05-12 · 🧮 math.CO

Recognition: 2 theorem links

· Lean Theorem

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

Philipp Heering , Klaus Metsch , Vladislav Taranchuk

Authors on Pith no claims yet

Pith reviewed 2026-05-14 20:44 UTC · model grok-4.3

classification 🧮 math.CO

keywords Kneser graphchromatic numberprojective planeincidence-free setsymmetric designperfect matchingincidence graphchambers

0 comments

The pith

The chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of the plane's incidence graph.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This note supplies an elementary proof that any symmetric design has a perfect matching between the complements of an equinumerous incidence-free pair of points and blocks. It applies the matching to projective planes to establish that the chromatic number of the Kneser graph whose vertices are the chambers is exactly the largest size of an incidence-free set in the incidence graph. A sympathetic reader would care because the equivalence converts a graph-coloring question into an extremal-set question inside classical design theory, letting bounds and constructions move in either direction.

Core claim

We prove that for a symmetric (v,k,λ)-design D=(P,B) and any equinumerous incidence-free pair (X,Y) with X subset P and Y subset B, the incidence graph admits a perfect matching between P minus X and B minus Y. This fact is used to show that the chromatic number of the Kneser graph on chambers of a projective plane is identical to the incidence-free number of the incidence graph of the plane.

What carries the argument

The guaranteed perfect matching between complements of equinumerous incidence-free pairs in the incidence graph of a symmetric design, which directly equates the two parameters.

If this is right

Any upper or lower bound previously obtained for the incidence-free number immediately supplies the same bound for the chromatic number.
The equivalence holds for projective planes of every order, with no size restriction required.
Elementary matching arguments replace earlier non-elementary proofs that needed k at least 36.
Algorithms or constructions that locate large incidence-free sets now serve as direct methods for coloring the corresponding Kneser graphs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

For the smallest planes the two numbers can be computed independently by exhaustive search on small incidence graphs to confirm numerical agreement.
The same matching technique might apply to certain non-symmetric designs and produce analogous equivalences between coloring and extremal-set parameters.
Explicit colorings of the Kneser graph can be built by using the guaranteed perfect matchings to partition the vertex set into independent sets.

Load-bearing premise

Any equinumerous incidence-free pair of points and blocks in a symmetric design leaves a remainder that admits a perfect matching in the incidence graph.

What would settle it

For the Fano plane compute the maximum size of an incidence-free set in its incidence graph and separately compute the chromatic number of the Kneser graph on its chambers; if the two integers differ, the claimed equivalence is false.

read the original abstract

Let $D=(\mathcal{P},\mathcal{B})$ be a symmetric $(v,k,\lambda)$-design and let $(X,Y)$ be an equinumerous incidence-free pair, with $X\subseteq \mathcal{P}$ and $Y\subseteq \mathcal{B}$. In this note, we give an elementary proof which shows the existence of a perfect matching between $\mathcal{P} \setminus X$ and $\mathcal{B}\setminus Y$ in the incidence graph of $D$. This recovers a result of Spiro, Adriaensen and Mattheus, who already showed this using different arguments for $k\geq 36$. We use this to connect some dots in the literature and prove that finding the chromatic number of the Kneser graph on chambers of a projective plane is equivalent to finding the incidence-free number of the incidence graph of the plane.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The note supplies an elementary proof of a perfect matching in symmetric designs after removing an equinumerous incidence-free pair and uses it to equate the chromatic number of the Kneser graph on chambers with the incidence-free number.

read the letter

The main thing to know is that this short note proves elementarily that any symmetric (v,k,λ)-design has a perfect matching between the complements of an equinumerous incidence-free pair in its incidence graph. This recovers the earlier result of Spiro, Adriaensen and Mattheus but without the k ≥ 36 restriction. They then apply the fact to show that the chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of the incidence graph of the plane. The proof is presented as straightforward and self-contained, which is the real contribution here. It makes a known combinatorial fact available for smaller parameters and draws a clean equivalence between two quantities that had been studied separately. The argument relies on standard design properties and appears to avoid circularity or fitted parameters. The soft spots are limited in scope rather than in execution. The equivalence follows fairly directly once the matching is in hand, so the paper does not produce new bounds or constructions, only the identification of the two problems. The work stays inside symmetric designs and these specific Kneser graphs, which keeps the impact narrow. No obvious gaps in the logic are visible from the description, and the citation to the prior non-elementary proof is handled properly. This is useful for combinatorialists and finite geometers who already care about chromatic numbers of Kneser graphs or incidence structures in projective planes. A reader in that area will get a clean tool and a new way to view the problem. It deserves peer review because the elementary proof is verifiable and the connection is precise, even if the overall reach is modest.

Referee Report

1 major / 2 minor

Summary. The paper gives an elementary proof that any symmetric (v,k,λ)-design D=(P,B) admits a perfect matching in its incidence graph between P∖X and B∖Y whenever (X,Y) is an equinumerous incidence-free pair. It then uses this fact to prove that the chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of the plane’s incidence graph, thereby recovering a result of Spiro–Adriaensen–Mattheus (previously known only for k≥36) and establishing an equivalence between two previously separate parameters.

Significance. If the central matching theorem holds, the note supplies a short, self-contained argument that removes the large-k restriction and directly links two combinatorial invariants arising from finite geometries. The elementary character of the proof is a genuine strength: it avoids the heavier machinery used earlier and may therefore be more readily adaptable to other designs or to algorithmic questions about matchings in incidence graphs.

major comments (1)

[Section 2 (proof of the matching theorem)] The manuscript asserts that the matching exists for every equinumerous incidence-free pair, yet the abstract only sketches the argument; a concrete verification that Hall’s condition (or the chosen combinatorial criterion) is satisfied for the smallest admissible parameters (e.g., the Fano plane, k=3) would strengthen the claim that the result is fully general rather than merely recovering the k≥36 case.

minor comments (2)

[Introduction / final paragraph] Notation for the Kneser graph on chambers is introduced only in the final paragraph; a brief definition or reference to the standard construction would help readers who encounter the equivalence for the first time.
[Abstract and §1] The statement that the new proof is “independent of the prior non-elementary arguments” is repeated; a single sentence contrasting the two approaches (e.g., “our argument uses only Hall’s theorem and double counting”) would suffice.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive summary, recognition of the elementary nature of the proof, and recommendation for minor revision. We address the major comment below by agreeing to strengthen the manuscript with the suggested verification.

read point-by-point responses

Referee: [Section 2 (proof of the matching theorem)] The manuscript asserts that the matching exists for every equinumerous incidence-free pair, yet the abstract only sketches the argument; a concrete verification that Hall’s condition (or the chosen combinatorial criterion) is satisfied for the smallest admissible parameters (e.g., the Fano plane, k=3) would strengthen the claim that the result is fully general rather than merely recovering the k≥36 case.

Authors: We agree that an explicit verification for the smallest admissible parameters would strengthen the presentation and confirm generality. In the revised manuscript we will add a short subsection (or expanded example) in Section 2 that carries out the verification for the Fano plane, the unique symmetric (7,3,1)-design. For every equinumerous incidence-free pair (X,Y) we will directly check that the bipartite incidence graph between P∖X and B∖Y satisfies Hall’s condition, using the explicit parameters and incidence structure of the Fano plane. This concrete case demonstrates that the elementary matching argument applies for k=3 without any appeal to the k≥36 hypothesis of the earlier work. revision: yes

Circularity Check

0 steps flagged

No circularity: elementary self-contained proof of matching existence

full rationale

The paper supplies a direct elementary combinatorial argument establishing the existence of a perfect matching between the complements of any equinumerous incidence-free pair (X,Y) in a symmetric design. This fact is then applied to demonstrate an equivalence between the Kneser chromatic number and the incidence-free number. Because the matching result is proved from first principles without reference to fitted parameters, self-referential definitions, or load-bearing self-citations, and because the cited prior work (Spiro et al.) is external and recovered rather than presupposed, the derivation chain does not reduce to its own inputs. The central claim therefore stands on independent combinatorial content.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the standard definition and incidence properties of symmetric designs together with a matching theorem in their bipartite incidence graphs; no new parameters or entities are introduced.

axioms (1)

domain assumption The incidence graph of a symmetric (v,k,λ)-design is a regular bipartite graph whose parameters satisfy the usual design equations.
Invoked to guarantee that Hall's condition or an equivalent matching criterion holds for the complements of incidence-free sets.

pith-pipeline@v0.9.0 · 5449 in / 1368 out tokens · 64494 ms · 2026-05-14T20:44:21.855998+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1.1: equinumerous incidence-free pair implies perfect matching in incidence graph of symmetric (v,k,λ)-design
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Corollary 1.5 equates optimal coloring of chamber Kneser graph to maximum equinumerous incidence-free set

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

92 extracted references · 92 canonical work pages

[1]

Large Incidence-free Sets in Geometries , volume =

De Winter, Stefaan and Schillewaert, Jeroen and Verstraete, Jacques , year =. Large Incidence-free Sets in Geometries , volume =. The Electronic Journal of Combinatorics , doi =

work page
[2]

The Electronic Journal of Combinatorics , doi =

Elvey Price, Andrew and Surani, Muhammad and Zhou, Sanming , year =. The Electronic Journal of Combinatorics , doi =

work page
[3]

Incidence-free sets and edge domination in incidence graphs , volume =

Spiro, Sam and Adriaensen, Sam and Mattheus, Sam , year =. Incidence-free sets and edge domination in incidence graphs , volume =. Journal of Combinatorial Designs , doi =

work page
[4]

Denniston , abstract =

R.H.F. Denniston , abstract =. Some maximal arcs in finite projective planes , journal =. 1969 , issn =. doi:https://doi.org/10.1016/S0021-9800(69)80095-5 , url =

work page doi:10.1016/s0021-9800(69)80095-5 1969
[5]

Interlacing eigenvalues and graphs , volume =

Haemers, Willem , year =. Interlacing eigenvalues and graphs , volume =. Linear Algebra and its Applications , doi =

work page
[6]

Journal of Combinatorial Designs , doi =

D'Haeseleer, Jozefien and Metsch, Klaus and Werner, Daniel , year =. Journal of Combinatorial Designs , doi =

work page
[7]

D'Haeseleer, Jozefien and Metsch, Klaus and Werner, Daniel , year =

work page
[8]

A short proof of the Hilton–Milner Theorem , journal =

BULAVKA, DENYS and WOODROOFE, RUSS , year =. A short proof of the Hilton–Milner Theorem , journal =

work page
[9]

A simple proof of the Hilton–Milner theorem , volume =

Frankl, Peter , year =. A simple proof of the Hilton–Milner theorem , volume =. Moscow Journal of Combinatorics and Number Theory , doi =

work page
[10]

1986 , issn =

Non-trivial intersecting families , journal =. 1986 , issn =. doi:https://doi.org/10.1016/0097-3165(86)90121-4 , url =

work page doi:10.1016/0097-3165(86)90121-4 1986
[11]

HILTON, A. J. W. and MILNER, E. C. , title =. The Quarterly Journal of Mathematics , volume =. 1967 , month =. doi:10.1093/qmath/18.1.369 , eprint =

work page doi:10.1093/qmath/18.1.369 1967
[12]

The eigenvalues of oppositeness graphs in buildings of spherical type , volume =

Brouwer, Andries , year =. The eigenvalues of oppositeness graphs in buildings of spherical type , volume =

work page
[13]

Maximal Sets of k -Spaces Pairwise Intersecting in at Least a (k-2) -Space , volume =

D'Haeseleer, Jozefien and Longobardi, Giovanni and Riet, Ago-Erik and Storme, Leo , year =. Maximal Sets of k -Spaces Pairwise Intersecting in at Least a (k-2) -Space , volume =. The Electronic Journal of Combinatorics , doi =

work page
[14]

Designs, Codes and Cryptography , doi =

Boeck, Maarten De , year =. Designs, Codes and Cryptography , doi =

work page
[15]

The Electronic Journal of Combinatorics , doi =

Metsch, Klaus , year =. The Electronic Journal of Combinatorics , doi =

work page
[16]

2022 , issn =

European Journal of Combinatorics , volume =. 2022 , issn =. doi:https://doi.org/10.1016/j.ejc.2021.103474 , author =

work page doi:10.1016/j.ejc.2021.103474 2022
[17]

Maximal cocliques in the Kneser graph on plane-solid flags in PG (6,q) , volume =

Metsch, Klaus and Werner, Daniel , year =. Maximal cocliques in the Kneser graph on plane-solid flags in PG (6,q) , volume =. Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial , doi =

work page
[18]

arXiv , primaryClass=:2505.14322 , journal=

Jan De Beule and Philipp Heering and Sam Mattheus and Klaus Metsch , year=. arXiv , primaryClass=:2505.14322 , journal=

work page arXiv
[19]

Journal of Combinatorial Theory, Series A , doi =

Metsch, Klaus , year =. Journal of Combinatorial Theory, Series A , doi =

work page
[20]

Ars Mathematica Contemporanea , doi =

Meagher, Karen and Shirazi, Mahsa and Stevens, Brett , year =. Ars Mathematica Contemporanea , doi =

work page
[21]

2201.02887 , archivePrefix=

Yuval Filmus and Nathan Lindzey , year=. 2201.02887 , archivePrefix=

work page arXiv
[22]

, TITLE =

Cameron, Peter J. , TITLE =. [1992] , PAGES =

work page 1992
[23]

2408.05015 , archivePrefix=

De Beule, Jan and Mattheus, Sam and Metsch, Klaus , year=. 2408.05015 , archivePrefix=

work page arXiv
[24]

Patricia Ure , language =

work page
[25]

Tim Joris Jacqueline Mussche , language =

work page
[26]

and Brouwer, A

Blokhuis, A. and Brouwer, A. E. and Chowdhury, A. and Frankl, P. and Mussche, T. and Patk\'. A. Electron. J. Combin. , FJOURNAL =. 2010 , NUMBER =

work page 2010
[27]

Blokhuis and A.E

A. Blokhuis and A.E. Brouwer and T.I. Szonyi. On the chromatic number of q -Kneser graphs. Designs, Codes and Cryptography. 2012. doi:10.1007/s10623-011-9513-1

work page doi:10.1007/s10623-011-9513-1 2012
[28]

Surveys in combinatorics 2022 , SERIES =

Ellis, David , TITLE =. Surveys in combinatorics 2022 , SERIES =. 2022 , ISBN =

work page 2022
[29]

Meagher, Karen and Purdy, Alison , year =

work page
[30]

Electron

Karen Meagher and Alison Purdy , title =. Electron. J. Comb. , volume =. 2011 , doi =

work page 2011
[31]

SIAM Journal on Algebraic Discrete Methods , volume =

Frankl, Peter and F\". SIAM Journal on Algebraic Discrete Methods , volume =. 1980 , doi =

work page 1980
[32]

The Electronic Journal of Combinatorics [electronic only] , doi =

Ku, Cheng Yeaw and Wong, Kok , year =. The Electronic Journal of Combinatorics [electronic only] , doi =

work page
[33]

Cameron, P. J. and Deza, M. and Frankl, P. , Title =. Combinatorica , ISSN =. 1988 , Language =. doi:10.1007/BF02126798 , Keywords =

work page doi:10.1007/bf02126798 1988
[34]

and Ku, C

Cameron, Peter J. and Ku, C. Y. , Title =. Eur. J. Comb. , ISSN =. 2003 , Language =. doi:10.1016/S0195-6698(03)00078-7 , Keywords =

work page doi:10.1016/s0195-6698(03)00078-7 2003
[35]

Rands, B. M. I. , Title =. J. Comb. Theory, Ser. A , ISSN =. 1982 , Language =. doi:10.1016/0097-3165(82)90055-3 , Keywords =

work page doi:10.1016/0097-3165(82)90055-3 1982
[36]

De Boeck, Maarten and Storme, Leo , Title =. Sci. China, Math. , ISSN =. 2013 , Language =. doi:10.1007/s11425-013-4676-z , Keywords =

work page doi:10.1007/s11425-013-4676-z 2013
[37]

Blocking sets and maximal strong representative systems in finite projective planes , volume =

Illés, Tibor and Szőnyi, Tamás and Wettl, Ferenc , year =. Blocking sets and maximal strong representative systems in finite projective planes , volume =

work page
[38]

2509.14291 , journal=

Zaphenath Joseph , year=. 2509.14291 , journal=

work page arXiv
[39]

1999 , issn =

The Construction of Cameron–Liebler Line Classes inPG(3,q) , journal =. 1999 , issn =. doi:https://doi.org/10.1006/ffta.1998.0239 , author =

work page doi:10.1006/ffta.1998.0239 1999
[40]

Metsch, Klaus , TITLE =. J. Geom. , FJOURNAL =. 2006 , NUMBER =. doi:10.1007/s00022-006-1889-0 , URL =

work page doi:10.1007/s00022-006-1889-0 2006
[41]

, TITLE =

Blokhuis, Aart and Brouwer, Andries E. , TITLE =. Combinatorica , FJOURNAL =. 2017 , NUMBER =. doi:10.1007/s00493-016-3438-2 , URL =

work page doi:10.1007/s00493-016-3438-2 2017
[42]

Electron

Metsch, Klaus , TITLE =. Electron. J. Combin. , FJOURNAL =. 2021 , NUMBER =. doi:10.37236/10239 , URL =

work page doi:10.37236/10239 2021
[43]

Blokhuis, Aart and Brouwer, Andries E. and G\". Cocliques in the. Combinatorica , FJOURNAL =. 2014 , NUMBER =. doi:10.1007/s00493-014-2779-y , URL =

work page doi:10.1007/s00493-014-2779-y 2014
[45]

GAP -- Groups, Algorithms, and Programming, Version 4.12.2

work page
[46]

Soicher, L. H. , title =. 2022 , note =

work page 2022
[47]

and Betten, A

Bamberg, J. and Betten, A. and Cara, P. and De Beule, J. and Lavrauw, M. and Neunhoeffer, M. and Horn, M. , title =. 2023 , note =

work page 2023
[48]

2023 , howpublished =

Heering, Philipp , title =. 2023 , howpublished =

work page 2023
[49]

2506.20556 , archivePrefix=

Philipp Heering , year=. 2506.20556 , archivePrefix=

work page arXiv
[50]

Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial , doi=

Metsch, Klaus and Werner, Daniel , year =. Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial , doi=

work page
[51]

, year =

Blokhuis, Aart and Brouwer, Andries E. , year =. Combinatorica , doi=

work page
[52]

1999 , issue_date =

Eisfeld, J\". 1999 , issue_date =. doi:10.1023/A:1008366907558 , journal =

work page doi:10.1023/a:1008366907558 1999
[53]

1975 , issn =

Intersection theorems for systems of finite vector spaces , journal =. 1975 , issn =. doi:https://doi.org/10.1016/0012-365X(75)90091-6 , author =

work page doi:10.1016/0012-365x(75)90091-6 1975
[54]

SIAM Journal on Algebraic Discrete Methods , volume =

Stanton, Dennis , title =. SIAM Journal on Algebraic Discrete Methods , volume =. 1980 , doi=

work page 1980
[55]

Discrete Mathematics , volume =

Grigory Ivanov and Seyda Köse , title =. Discrete Mathematics , volume =. 2023 , issn =. doi:https://doi.org/10.1016/j.disc.2023.113363 , keywords =

work page doi:10.1016/j.disc.2023.113363 2023
[56]

Journal of the American Mathematical Society , doi =

Ellis, David and Friedgut, Ehud and Pilpel, Haran , year =. Journal of the American Mathematical Society , doi =

work page
[57]

2011 , publisher=

Karen Meagher and Alison Purdy , journal=. 2011 , publisher=

work page 2011
[58]

2018 , issn =

Journal of Combinatorial Theory, Series A , volume =. 2018 , issn =. doi:https://doi.org/10.1016/j.jcta.2017.08.018 , author =

work page doi:10.1016/j.jcta.2017.08.018 2018
[59]

Forum Mathematicum , doi=

, author =. Forum Mathematicum , doi=. 2019 , lastchecked =

work page 2019
[60]

2014 , note =

European Journal of Combinatorics , volume =. 2014 , note =. doi:https://doi.org/10.1016/j.ejc.2013.06.005 , author =

work page doi:10.1016/j.ejc.2013.06.005 2014
[61]

2022 , issn =

Linear Algebra and its Applications , volume =. 2022 , issn =. doi:https://doi.org/10.1016/j.laa.2022.02.013 , author =

work page doi:10.1016/j.laa.2022.02.013 2022
[62]

2025 , issn =

Discrete Mathematics , volume =. 2025 , issn =. doi:https://doi.org/10.1016/j.disc.2024.114392 , author =

work page doi:10.1016/j.disc.2024.114392 2025
[63]

2021 , volume=

Klaus Metsch , journal=. 2021 , volume=

work page 2021
[64]

2022 , issn =

On regular systems of finite classical polar spaces , journal =. 2022 , issn =. doi:https://doi.org/10.1016/j.ejc.2021.103439 , author =

work page doi:10.1016/j.ejc.2021.103439 2022
[65]

, TITLE =

Brouwer, Andries E. , TITLE =. Combinatorics and graphs , SERIES =. 2010 , MRCLASS =

work page 2010
[66]

2021 , issn =

Hoffman's ratio bound , journal =. 2021 , issn =. doi:https://doi.org/10.1016/j.laa.2021.02.010 , author =

work page doi:10.1016/j.laa.2021.02.010 2021
[67]

2406.00740 , archivePrefix=

Philipp Heering and Jesse Lansdown and Klaus Metsch , year=. 2406.00740 , archivePrefix=

work page arXiv
[69]

1994 , issn =

m-systems of polar spaces , journal =. 1994 , issn =. doi:https://doi.org/10.1016/0097-3165(94)90097-3 , urlurl =

work page doi:10.1016/0097-3165(94)90097-3 1994
[70]

Jan De Beule and Andreas Klein and Klaus Metsch and Leo Storme , journal =

work page
[71]

Algebraic Graph Theory , doi=

Godsil, Chris and Royle, Gordon , year =. Algebraic Graph Theory , doi=

work page
[72]

2007 , issn =

Tight sets and m-ovoids of finite polar spaces , journal =. 2007 , issn =. doi:https://doi.org/10.1016/j.jcta.2007.01.009 , author =

work page doi:10.1016/j.jcta.2007.01.009 2007
[73]

Vanhove, Frédéric , keywords =

work page
[74]

Brouwer and Arjeh M

Andries E. Brouwer and Arjeh M. Cohen and Arnold Neumaier. Distance-regular graphs. 1989

work page 1989
[75]

Journal of Algebraic Combinatorics , doi=

Metsch, Klaus , year =. Journal of Algebraic Combinatorics , doi=

work page
[76]

2011 , issn =

Journal of Combinatorial Theory, Series A , volume =. 2011 , issn =. doi:https://doi.org/10.1016/j.jcta.2011.01.003 , author =

work page doi:10.1016/j.jcta.2011.01.003 2011
[77]

Hirschfeld, James W. P. , TITLE =. 1998 , PAGES =

work page 1998
[78]

Hirschfeld, James W. P. and Thas, Joseph A. , TITLE =. 1991 , PAGES =

work page 1991
[79]

De Beule, Jan and Mattheus, Sam and Metsch, Klaus , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 2022 , PAGES =. doi:10.1016/j.jcta.2022.105657 , urlurl =

work page doi:10.1016/j.jcta.2022.105657 2022
[80]

Journal of Combinatorial Designs , volume =

Heering, Philipp and Metsch, Klaus , title =. Journal of Combinatorial Designs , volume =. doi:https://doi.org/10.1002/jcd.21940 , year =

work page doi:10.1002/jcd.21940
[81]

1986 , issn =

Journal of Combinatorial Theory, Series A , volume =. 1986 , issn =. doi:https://doi.org/10.1016/0097-3165(86)90063-4 , author =

work page doi:10.1016/0097-3165(86)90063-4 1986
[82]

The Electronic Journal of Combinatorics , doi=

Ihringer, Ferdinand , year =. The Electronic Journal of Combinatorics , doi=

work page

Showing first 80 references.