Extremal problems involving vertices and edges on odd cycles
From MaRDI portal
Publication:1197010
DOI10.1016/0012-365X(92)90586-5zbMATH Open0767.05056MaRDI QIDQ1197010FDOQ1197010
Authors: Ralph Faudree, Cecil Rousseau, P. Erdős
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- On maximal paths and circuits of graphs
- Graphs with unavoidable subgraphs with large degrees
- An extremal problem for paths in bipartite graphs
- Title not available (Why is that?)
- Sufficient Conditions for Circuits in Graphs†
- On a theorem of Rademacher-Turán
- Title not available (Why is that?)
- Degree sum for a triangle in a graph
Cited In (8)
- Minimizing the number of triangular edges
- Extremal problems for imbalanced edges
- Extremal graphs for odd wheels
- Edges not in any monochromatic copy of a fixed graph
- Minimum number of edges that occur in odd cycles
- A note on a conjecture about cycles with many incident chords
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
- Extremal problems for cycles in graphs
This page was built for publication: Extremal problems involving vertices and edges on odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197010)