The maximum number of edges in a \K_r+1,M_k+1\-free graph
From MaRDI portal
Publication:6985864
Cites work
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Eine Extremalaufgabe aus der Graphentheorie.
- Extremal graphs for edge blow-up of graphs
- Extremal graphs for odd wheels
- Extremal graphs for the k-flower
- Graph theory
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Intersection theorems for systems of sets
- Matching theory
- On a problem of K. Zarankiewicz
- On a Turán type problem of Erdős
- On maximal paths and circuits of graphs
- On the size of graphs with complete-factors
- Perfect matchings of a graph
- Testing for Equality between Maximum Matching and Minimum Node Covering
- The Factorization of Linear Graphs
- Turán graphs with bounded matching number
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Vraagstuk XXVIII.
- What we know and what we do not know about Turán numbers
Cited in
(3)
This page was built for publication: The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985864)
