Generalized Turán problems for double stars
From MaRDI portal
Publication:6041852
DOI10.1016/j.disc.2023.113395zbMath1514.05078arXiv2112.11144MaRDI QIDQ6041852
Publication date: 15 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.11144
Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Related Items (2)
The cycle of length four is strictly \(F\)-Turán-good ⋮ Some exact results for non-degenerate generalized Turán problems
Cites Work
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Extremal graphs for intersecting triangles
- On Turán-good graphs
- Some exact results for generalized Turán problems
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Intersection theorems for systems of sets
- Maximizing the Number of Independent Sets of a Fixed Size
- On a problem of K. Zarankiewicz
- Many \(T\) copies in \(H\)-free graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized Turán problems for double stars
