Recommendations
Cites work
- A generalized Turán problem and its applications
- Cycles of even length in graphs
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Many \(T\) copies in \(H\)-free graphs
- On maximal paths and circuits of graphs
- On Sets of Acquaintances and Strangers at any Party
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- On Turán-good graphs
- Regular Tur\'an numbers
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Regular Turán numbers of complete bipartite graphs
- Singular Turán numbers and worm-colorings
- Some exact results for generalized Turán problems
- Some exact results for regular Turán problems for all large orders
- Subgraph densities in \(K_r\)-free graphs
- The history of degenerate (bipartite) extremal graph problems
- The maximum number of P_\ell copies in P_k-free graphs
Cited in
(3)
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)
