Upper bounds for the number of substructures in finite geometries from the container method

DOI10.1016/J.JCTA.2024.105968MaRDI QIDQ6650527

Geertrui Van de Voorde, Sam Mattheus

Publication date: 9 December 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

ovoidsspreadscapshypergraph containers

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• Title not available (Why is that?)
• Online containers for hypergraphs, with applications to linear equations
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• Explicit construction of linear sized tolerant networks
• Interlacing eigenvalues and graphs
• The eigenspaces of the Bose-Mesner algebras of the association schemes corresponding to projective spaces and polar spaces
• Counting sum-free sets in abelian groups
• Arcs in \(\mathbb{F}_q^2\)
• An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
• The maximum size of a partial spread in a finite projective space
• Sharp bounds for some multicolour Ramsey numbers
• Hoffman's ratio bound
• The probabilistic method
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Asymptotic Number of Lattices
• Strongly Regular Graphs
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Independent sets in hypergraphs
• Counting arcs in \(\mathbb{F}_q^2\)

This page was built for publication: Upper bounds for the number of substructures in finite geometries from the container method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650527)