Extremal problems involving vertices and edges on odd cycles

DOI10.1016/0012-365X(92)90586-5zbMath0767.05056MaRDI QIDQ1197010

Paul Erdős, Ralph J. Faudree, Cecil C. Rousseau

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal problemsodd cyclesTurán graph

Mathematics Subject Classification ID

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

Related Items

Minimizing the Number of Triangular Edges, The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs, Edges not in any monochromatic copy of a fixed graph, Minimum number of edges that occur in odd cycles

Cites Work

• On a theorem of Rademacher-Turán
• On maximal paths and circuits of graphs
• An extremal problem for paths in bipartite graphs
• Graphs with unavoidable subgraphs with large degrees
• Sufficient Conditions for Circuits in Graphs^†
• Degree sum for a triangle in a graph
• Unnamed Item
• Unnamed Item