Extremal graphs without 4-cycles (Q744158): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Jason S. Williford / rank | |||
Property / author | |||
Property / author: Jason S. Williford / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005344823 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1201.4912 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polarities in finite projective planes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4410006 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs without four-cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5567712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs without quadrilaterals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of edges of quadrilateral-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über ein Problem von K. Zarankiewicz / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4017046 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 02:29, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extremal graphs without 4-cycles |
scientific article |
Statements
Extremal graphs without 4-cycles (English)
0 references
6 October 2014
0 references
\(C_4\)-free graph
0 references
upper bound for the number of edges
0 references