Cycle lengths in sparse graphs
From MaRDI portal
Publication:949802
DOI10.1007/s00493-008-2300-6zbMath1174.05065arXiv0707.2117OpenAlexW2143169901WikidataQ56227676 ScholiaQ56227676MaRDI QIDQ949802
Benjamin Sudakov, Jacques Verstraete
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.2117
Related Items
On 2-power unicyclic cubic graphs, Cycle lengths and minimum degree of graphs, Unnamed Item, Linear cycles of consecutive lengths, Cycles of many lengths in Hamiltonian graphs, Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs, Cycles with consecutive odd lengths, Hamilton cycles in highly connected and expanding graphs, A solution to Erdős and Hajnal’s odd cycle problem, Generalized Turán problems for even cycles, Cycle spectra of Hamiltonian graphs, Circumference, chromatic number and online coloring, Gaps in the cycle spectrum of 3-connected cubic planar graphs, Cycles in triangle-free graphs of large chromatic number, On some cycles in Wenger graphs, A Strengthening on Odd Cycles in Graphs of Given Chromatic Number, The extremal function for cycles of length \(\ell\) mod \(k\), Cycles in graphs of fixed girth with large size, Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics, Pancyclicity of Hamiltonian and highly connected graphs, A randomized embedding algorithm for trees, On a conjecture of Bondy and Vince, Cycles of given lengths in hypergraphs, Cycle lengths in expanding graphs, Subdivisions of a large clique in \(C_6\)-free graphs, Cycle lengths modulo \(k\) in expanders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Graphs with \(k\) odd cycle lengths
- Hamiltonian circuits in random graphs
- The number of cycle lengths in graphs of given minimum degree and girth
- Norm-graphs: Variations and applications
- Weakly pancyclic graphs
- Cycles of even length in graphs
- Distribution of cycle lengths in graphs
- A note on cycle lengths in graphs
- Pancyclic graphs. I
- Norm-graphs and bipartite Turán numbers
- On Arithmetic Progressions of Cycle Lengths in Graphs
- On the distribution of cycle lengths in graphs
- Circumference and girth
- Cycles Modulo k
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On a graph theorem by dirac
- On a problem of K. Zarankiewicz
