Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle
From MaRDI portal
Publication:5219318
DOI10.1017/S0963548318000354zbMath1434.05077arXiv1707.06482OpenAlexW3104234972WikidataQ114116555 ScholiaQ114116555MaRDI QIDQ5219318
Beka Ergemlidze, Abhishek Methuku, Ervin Gyoeri
Publication date: 11 March 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.06482
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Triangles in C5‐free graphs and hypergraphs of girth six ⋮ Graphs with no induced \(K_{2,t}\) ⋮ On induced saturation for paths
Cites Work
- Turán numbers of bipartite graphs plus an odd cycle
- Norm-graphs: Variations and applications
- Compactness results in extremal graph theory
- New asymptotics for bipartite Turán numbers
- Norm-graphs and bipartite Turán numbers
- The Maximum Number of Triangles in C2k+1-Free Graphs
- An Upper Bound on Zarankiewicz' Problem
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
