The extremal function for cycles of length \(\ell\) mod \(k\)
From MaRDI portal
Publication:510312
zbMath1355.05143arXiv1606.08532MaRDI QIDQ510312
Benjamin Sudakov, Jacques Verstraete
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.08532
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (5)
Cycle lengths and minimum degree of graphs ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ Cycles of given lengths in hypergraphs ⋮ Cycle lengths in expanding graphs
Cites Work
- Unnamed Item
- Ramsey goodness of paths
- Cycles with consecutive odd lengths
- Cycle lengths in sparse graphs
- Graphs with \(k\) odd cycle lengths
- Hamiltonian circuits in random graphs
- Cycles of length 0 modulo 4 in graphs
- Graphs with a cycle of length divisible by three
- New upper bounds on the order of cages
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Cycle lengths and minimum degree of graphs
- Cycles in triangle-free graphs of large chromatic number
- Even cycles in hypergraphs
- Cycles of even length in graphs
- Distribution of cycle lengths in graphs
- Cycle lengths and chromatic number of graphs
- Odd cycles and \(\Theta\)-cycles in hypergraphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Cycles of even lengths modulo k
- Cycles Modulo k
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- A note on odd cycle-complete graph Ramsey numbers
This page was built for publication: The extremal function for cycles of length \(\ell\) mod \(k\)
