Generalized Turán problems for small graphs
From MaRDI portal
Cites work
- A generalized Turán problem and its applications
- Counting copies of a fixed subgraph in F-free graphs
- Eine Extremalaufgabe aus der Graphentheorie.
- Exact results on generalized Erdős-Gallai problems
- Generalized Turán problems for disjoint copies of graphs
- Generalized Turán problems for even cycles
- Generalized Turán problems for even cycles
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (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
- Maximizing the number of independent sets of a fixed size
- New asymptotics for bipartite Turán numbers
- On a valence problem in extremal graph theory
- On maximal paths and circuits of graphs
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- On the maximum number of five-cycles in a triangle-free graph
- On the number of edges of quadrilateral-free graphs
- On the number of pentagons in triangle-free graphs
- Path Ramsey numbers in multicolorings
- Pentagons vs. triangles
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Some exact results for generalized Turán problems
- Some sharp results on the generalized Turán numbers
- The inducibility of complete bipartite graphs
- The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs
Cited in
(6)- Generalized Turán problem with bounded matching number
- Counting multiple graphs in generalized Turán problems
- On weakly Turán-good graphs
- On degree powers and counting stars in F-free graphs
- Generalized Turán results for matchings
- The generalized Turán number for K₃ in graphs without suspensions of a path on five vertices
This page was built for publication: Generalized Turán problems for small graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985997)
