Large incidence-free sets in geometries

zbMath1266.51004MaRDI QIDQ1953330

Jacques Verstraete, Jeroen Schillewaert, Stefaan De Winter

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p24

zbMATH Keywords

generalized polygonseigenvaluesprobabilistic method

Mathematics Subject Classification ID

Generalized quadrangles and generalized polygons in finite geometry (51E12) Eigenvalues, singular values, and eigenvectors (15A18) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (17)

Spectral gap in random bipartite biregular graphs and applications ⋮ Independent transversals in bipartite correspondence-covers ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) ⋮ Incidence‐free sets and edge domination in incidence graphs ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Explicit non-malleable codes from bipartite graphs ⋮ On finite generalized quadrangles of even order ⋮ Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping ⋮ Minimal multiple blocking sets ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Unnamed Item ⋮ On regular induced subgraphs of generalized polygons ⋮ Independent Sets in Polarity Graphs ⋮ Trace of Products in Finite Fields from a Combinatorial Point of View ⋮ Acyclic subgraphs of tournaments with high chromatic number

This page was built for publication: Large incidence-free sets in geometries