2009
DOI: 10.2140/iig.2009.10.147
|View full text |Cite
|
Sign up to set email alerts
|

On generalizing generalized polygons

Abstract: The purpose of this paper is to reveal in geometric terms a decade-old construction of certain families of graphs with nice extremal properties. Construction of the graphs in question is motivated by the way in which regular generalized polygons may be embedded in their Lie algebras, so that point-line incidence corresponds to the vanishing Lie product. The only caveat is that the generalized polygons are greatly limited in number. By performing successive truncations on an infinite root system of type e A 1 ,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
7
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 19 publications
(18 reference statements)
0
7
0
Order By: Relevance
“…Since probabilistic lower bounds for 3-graphs tend to be weak, we try to strengthen this result via a look at the graphs D(k, q). Here we present a summary of the properties of D(k, q); for more details, the reader is referred to [9,10,22].…”
Section: Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since probabilistic lower bounds for 3-graphs tend to be weak, we try to strengthen this result via a look at the graphs D(k, q). Here we present a summary of the properties of D(k, q); for more details, the reader is referred to [9,10,22].…”
Section: Graphsmentioning
confidence: 99%
“…For k ∈ {2, 3, 5}, the best known lower bounds are given by the bipartite graphs CD(k, q) [9,10] for integers k ≥ 2 and prime powers q. These graphs arise from Lie algebraic incidence structures that approximate the behavior of generalized polygons, and are analyzed in detail in [22]. For a recent survey on the even cycle problem, the reader is referred to [20].…”
Section: Introductionmentioning
confidence: 99%
“…This is motivated by work in [6] and [17]. The basic construction is identical to the presentation in [17] with the exception of the Lie algebra used.…”
Section: Lie Graphsmentioning
confidence: 99%
“…This is motivated by work in [6] and [17]. The basic construction is identical to the presentation in [17] with the exception of the Lie algebra used. In particular, the Cartan subalgebra differs in certain cases, thereby allowing us to obtain new families of graphs that would otherwise be degenerate.…”
Section: Lie Graphsmentioning
confidence: 99%
See 1 more Smart Citation