A stability theorem for multi-partite graphs
From MaRDI portal
Cites work
- A note on vertex list colouring
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- An extremal graph problem
- Complete solution for the rainbow numbers of matchings
- Complete subgraphs in multipartite graphs
- Complete Subgraphs of r-partite Graphs
- Counting substructures. I: Color critical graphs
- Extremal problems for transversals in graphs with bounded degree
- Finite abelian groups and factorization problems
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3520443 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3298603 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Odd Independent Transversals are Odd
- On a problem of K. Zarankiewicz
- On complete subgraphs of r-chromatic graphs
- On the structure of linear graphs
- Some remarks on the Zarankiewicz problem
- Supersaturation problem for color-critical graphs
- Turán number of disjoint triangles in 4-partite graphs
- Turán numbers of vertex-disjoint cliques in r-partite graphs
This page was built for publication: A stability theorem for multi-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879456)
