Generalized Turán numbers for the edge blow-up of a graph
From MaRDI portal
Publication:6080138
DOI10.1016/j.disc.2023.113682zbMath1525.05097arXiv2210.11914OpenAlexW4386435362MaRDI QIDQ6080138
Zequn Lv, Casey Tompkins, Ervin Gyoeri, Kitti Varga, Xiutao Zhu, Nika Salia, Zhen He
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.11914
Cites Work
- Unnamed Item
- Extremal graphs for intersecting cliques
- Extremal graphs for intersecting triangles
- Extremal graphs for blow-ups of cycles and trees
- The Turán number of the square of a path
- Generalized Turán problems for complete bipartite graphs
- On generalized Turán number of two disjoint cliques
- The Turán number for the edge blow-up of trees
- Extremal graphs for edge blow-up of graphs
- On Independent Complete Subgraphs in a Graph
- The maximum number of triangles in \(F_k\)-free graphs
This page was built for publication: Generalized Turán numbers for the edge blow-up of a graph