The number of \(C_{2\ell}\)-free graphs

DOI10.1016/j.aim.2016.05.001zbMath1339.05199arXiv1309.2927WikidataQ105583557 ScholiaQ105583557MaRDI QIDQ291780

Robert Morris, David Saxton

Publication date: 10 June 2016

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2927

zbMATH Keywords

extremal graph theorybalanced supersaturationhypergraph containers

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

Related Items

Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Supersaturation of even linear cycles in linear hypergraphs, Ramsey Numbers for Nontrivial Berge Cycles, Counting H-free orientations of graphs, Relative Turán Problems for Uniform Hypergraphs, An efficient container lemma, Balanced supersaturation for some degenerate hypergraphs, Counting hypergraphs with large girth, Random polynomial graphs for random Turán problems, Turán‐type problems for long cycles in random and pseudo‐random graphs, Hypergraph containers, Cycles in graphs of fixed girth with large size, The number of hypergraphs without linear cycles, On hypergraphs without loose cycles, Triangle-free subgraphs of hypergraphs, Pattern avoidance over a hypergraph, Integer colorings with no rainbow 3-term arithmetic progression, Counting \(r\)-graphs without forbidden configurations, Counting Gallai 3-colorings of complete graphs, Counting independent sets in graphs, On the number of union-free families, Graph theory. Abstracts from the workshop held January 2--8, 2022, The Turán number of directed paths and oriented cycles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of \(B_3\)-sets of a given cardinality
• Combinatorial theorems in sparse random sets
• Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
• Hypergraph containers
• The fine structure of octahedron-free graphs
• The number of \(K_{m,m}\)-free graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the number of graphs without 4-cycles
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• An extremal problem for random graphs and the number of graphs with large even-girth
• Norm-graphs: Variations and applications
• Properties of certain families of \(2k\)-cycle-free graphs
• The number of graphs without forbidden subgraphs
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• Turán's extremal problem in random graphs: Forbidding even cycles
• New asymptotics for bipartite Turán numbers
• On the Turán number for the hexagon
• Norm-graphs and bipartite Turán numbers
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Maximum-size antichains in random set-systems
• A note on the Turán function of even cycles
• Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• The number of Bh‐sets of a given cardinality
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Independent sets in hypergraphs
• On the Number ofB_h-Sets
• The number of K _s,t -free graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Extremal Results in Random Graphs
• Minimal Regular Graphs of Girths Eight and Twelve
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• On the structure of linear graphs