Graphs of diameter two with no 4-circuits (Q1301629): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Siemion Fajtlowicz / rank | |||
Property / reviewed by | |||
Property / reviewed by: William G. Brown / rank | |||
Property / author | |||
Property / author: Siemion Fajtlowicz / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: William G. Brown / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polarities in finite projective planes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5567712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q105675652 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00321-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983155670 / rank | |||
Normal rank |
Latest revision as of 10:49, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs of diameter two with no 4-circuits |
scientific article |
Statements
Graphs of diameter two with no 4-circuits (English)
0 references
30 January 2000
0 references
Theorem: Let \(G\) be a simple graph with diameter two and no 4-circuit. Then one of the following is true: (a) The maximum degree is \(n-1\); (b) \(G\) is a Moore graph (i.e. a regular simple graph with diameter 2 and girth 5); (c) \(G\) is a polarity graph (i.e.\ a graph \(G=(V,E)\) associated with a polarity of a projective plane---\(V\) is the point-set of the plane; \(pq\in E\) iff \(p\neq q\) and \(p\) lies on the polar line of \(q\)). Author Bondy acknowledges that their result, which dates back to 1979, was ``subsumed by a theorem of W. M. Kantor'' [Moore geometries and rank \(3\) groups having \(\mu=1\). Q. J. Math. Oxf., II. Ser. 28, No. 111, 309-328 (1977; Zbl 0406.05020)], but states that ``In the intervening years it has become apparent that this particular case of Kantor's theorem, with its attractive statement and simple proof, is not as widely known as perhaps it merits. For this reason Erdős proposed to me that we resubmit the article for publication''.
0 references