Generalized regular Turán numbers
From MaRDI portal
Publication:6644902
Dániel Gerbner, Hilal Hama Karim
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Cycles of even length in graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On Turán-good graphs
- Regular Turán numbers of complete bipartite graphs
- Some exact results for generalized Turán problems
- Singular Turán numbers and worm-colorings
- Subgraph densities in \(K_r\)-free graphs
- On maximal paths and circuits of graphs
- On Sets of Acquaintances and Strangers at any Party
- Regular Tur\'an numbers
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- A generalized Turán problem and its applications
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Many \(T\) copies in \(H\)-free graphs
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Some exact results for regular Turán problems for all large orders
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)
