A note on bipartite subgraphs and triangle-independent sets
From MaRDI portal
Publication:2374154
DOI10.1016/j.disc.2016.07.021zbMath1351.05176arXiv1512.06202OpenAlexW2212806590MaRDI QIDQ2374154
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06202
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- How to make a graph bipartite
- Density conditions for triangles in multipartite graphs
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
- Making a \(K_4\)-free graph bipartite
- Covering and independence in triangle structures
- extremal aspects of the Erdős-Gallai-Tuza conjecture
- On some extremal problems in graph theory
- Bipartite subgraphs
- On a Conjecture of Erdős, Gallai, and Tuza
- The maximum number of edges in a minimal graph of diameter 2
- A Selection of Problems and Results in Combinatorics