Graphs with large maximum degree containing no odd cycles of a given length

DOI10.1016/S0095-8956(02)00024-2zbMath1030.05061OpenAlexW1988348129MaRDI QIDQ1405126

Oliver Riordan, Richard H. Schelp, Paul N. Balister, Béla Bollobás

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00024-2

zbMATH Keywords

complete bipartite graphextremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

My Friend and Colleague, Richard Schelp, Graphs with large maximum degree containing no edge-critical graphs, On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees, Triangle-free graphs with the maximum number of cycles, Connected graphs without long paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• Longest cycles in 3-connected planar graphs
• Hamiltonism, degree sum and neighborhood intersections
• Hamiltonian properties of graphs with large neighborhood unions
• Cycles of even length in graphs
• Large cycles in graphs
• On maximal paths and circuits of graphs
• Long cycles and neighborhood union in 1-tough graphs with large degree sums
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs