A Generalized Turán Problem and its Applications

DOI10.1093/imrn/rny108zbMath1483.05082OpenAlexW2809477600MaRDI QIDQ5015565

Asaf Shapira, Lior Gishboliner

Publication date: 9 December 2021

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imrn/rny108

zbMATH Keywords

cyclecomplete graphTuran problem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (18)

Some exact results for generalized Turán problems ⋮ On generalized Turán number of two disjoint cliques ⋮ The maximum number of paths of length four in a planar graph ⋮ Generalized rainbow Turán numbers of odd cycles ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ On Turán numbers for disconnected hypergraphs ⋮ Random polynomial graphs for random Turán problems ⋮ Local-vs-global combinatorics ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ Some exact results of the generalized Turán numbers for paths ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Some results on \(k\)-Turán-good graphs ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Generalized Turán densities in the hypercube ⋮ The generalized Turán number of spanning linear forests

This page was built for publication: A Generalized Turán Problem and its Applications