Substructures in finite classical polar spaces

Metsch, Klaus

doi:10.1007/s00022-011-0089-8

Cited by 1 publication

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, Beukemann and Metsch proved the bound only for the quadrangle Q(4, q) while our bound holds for arbitrary generalized quadrangles of order q, where q can be any integer. Our bound also answers the question of Metsch [21,Section 6] by proving that there cannot exist any constant c > 1 for which the parabolic quadric Q(4, q) has a 1-good structure of size greater than cq 2 .…”

Section: Bounds On Regular Induced Subgraphssupporting

confidence: 52%

See 1 more Smart Citation

On regular induced subgraphs of generalized polygons

Bamberg

Bishnoi

Royle

2018

Journal of Combinatorial Theory, Series A

View full text Add to dashboard Cite

The cage problem asks for the smallest number c(k, g) of vertices in a k-regular graph of girth g and graphs meeting this bound are known as cages. While cages are known to exist for all integers k 2 and g 3, the exact value of c(k, g) is known only for some small values of k, g and three infinite families where g ∈ {6, 8, 12} and k − 1 is a prime power. These infinite families come from the incidence graphs of generalized polygons. Some of the best known upper bounds on c(k, g) for g ∈ {6, 8, 12} have been obtained by constructing small regular induced subgraphs of these cages.In this paper, we first use the Expander Mixing Lemma to give a general lower bound on the size of an induced k-regular subgraph of a regular bipartite graph in terms of the second largest eigenvalue of the host graph. We use this bound to show that the known construction of (k, 6)-graphs using Baer subplanes of the Desarguesian projective plane is the best possible. For generalized quadrangles and hexagons, our bounds are new. In particular, we improve the known lower bound on the size of an induced q-regular subgraphs of the classical generalized quadrangle Q(4, q) and show that the known constructions are asymptotically sharp, which answers a question of Metsch [21, Section 6].For prime powers q, we also improve the known upper bounds on c(q, 8) and c(q, 12) by giving new geometric constructions of q-regular induced subgraphs in the symplectic generalized quadrangle W(3, q) and the split Cayley hexagon H(q), respectively. Our constructions show thatfor q an even power of a prime, and c(q, 12) 2(q 5 − 3q 3 ) for all prime powers q. For q ∈ {3, 4, 5} we also give a computer classification of all q-regular induced subgraphs of the classical generalized quadrangles of order q. For W(3, 7) we classify all 7-regular induced subgraphs which have a non-trivial automorphism.2010 Mathematics Subject Classification. Primary 05C50, 05C35, 51E12.

show abstract

Section: Bounds On Regular Induced Subgraphssupporting

confidence: 52%

“…These bounds give us a limit on the best upper bounds on c(k, g) that can be obtained, for g ∈ {6, 8, 12}, by this construction method. Our bound on generalized quadrangles in particular answers a question of Metsch [21,Section 6].…”

Section: Introductionmentioning

confidence: 71%