Exact bipartite Turán numbers of large even cycles

DOI10.1002/jgt.22676zbMath1522.05212arXiv1901.06137WikidataQ114236152 ScholiaQ114236152MaRDI QIDQ6080869

Bo Ning, Bin Long Li

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

bipartite grapheven cycleJackson's theorembipartite Turán number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

Bipartite Ramsey numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Stability results on the circumference of a graph
• Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
• Long cycles in bipartite graphs
• Cycles in bipartite graphs
• A method in graph theory
• Hamilton cycles in 2-connected regular bipartite graphs
• \(C_ 6\)-free bipartite graphs and product representation of squares
• A sufficient condition for all short cycles
• Weakly pancyclic graphs
• Even cycles in hypergraphs
• Cycles of given lengths in hypergraphs
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Large cycles in graphs
• On Hamiltonian bipartite graphs
• Heavy cycles passing through some specified vertices in weighted graphs
• On maximal paths and circuits of graphs
• Triangle-Free Hypergraphs
• An extremal problem for paths in bipartite graphs
• Maximal circuits of graphs. I
• Cycles in bipartite graphs and an application in number theory
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Sufficient Conditions for Circuits in Graphs^†
• A Note on Bipartite Graphs Without 2 k -Cycles
• On a problem of K. Zarankiewicz