Generalized regular Turán numbers
From MaRDI portal
Publication:6644902
Authors: Dániel Gerbner, Hilal Hama Karim 
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On maximal paths and circuits of graphs
- The history of degenerate (bipartite) extremal graph problems
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Title not available (Why is that?)
- Cycles of even length in graphs
- On Sets of Acquaintances and Strangers at any Party
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular Turán numbers of complete bipartite graphs
- Subgraph densities in \(K_r\)-free graphs
- Many \(T\) copies in \(H\)-free graphs
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Some exact results for generalized Turán problems
- A generalized Turán problem and its applications
- On Turán-good graphs
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Regular Tur\'an numbers
- Singular Turán numbers and worm-colorings
- Some exact results for regular Turán problems for all large orders
Cited In (1)
This page was built for publication: Generalized regular Turán numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644902)
