A Bound on the Number of Edges in Graphs Without an Even Cycle (Q5366930): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.1601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Regular Graphs of Girths Eight and Twelve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / 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: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turán number for the hexagon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of graphs with an arbitrary large girth and of large size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of bipartite graphs from finite geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Turán function of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Arithmetic Progressions of Cycle Lengths in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1815896765 / rank
 
Normal rank

Latest revision as of 09:30, 30 July 2024

scientific article; zbMATH DE number 6788936
Language Label Description Also known as
English
A Bound on the Number of Edges in Graphs Without an Even Cycle
scientific article; zbMATH DE number 6788936

    Statements

    Identifiers