scientific article; zbMATH DE number 3931048

MaRDI QIDQ3705481zbMATH OpenFDO

Authors Bruce Rothschild, Esther R. Lamken

Publication date 1984

zbMATH Keywords

cyclesC(2k\(+1)\)-free graphs

Mathematics Subject Classification ID

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

Recommendations

• On the maximum number of odd cycles in graphs without smaller odd cycles
• Extremal numbers for odd cycles
• Edge maximal non-bipartite graphs without odd cycles of prescribed lengths
• Graphs without cycles of even length
• Graphs with large maximum degree containing no odd cycles of a given length

Cited in

(12)

• On the maximum number of odd cycles in graphs without smaller odd cycles
• Tools for counting odd cycles in graphs
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• On the maximum number of odd cycles in graphs without smaller odd cycles
• Counting odd cycles in locally dense graphs
• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• Extremal numbers for odd cycles
• On digraphs with the odd cycle property
• Discrete metric spaces: structure, enumeration, and 0-1 laws
• scientific article; zbMATH DE number 4156480 (Why is no real title available?)
• Graphs with large maximum degree containing no odd cycles of a given length
• A Bound on the Number of Edges in Graphs Without an Even Cycle

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705481)