Extremal graphs with bounded densities of small subgraphs
From MaRDI portal
Recommendations
Cited in
(14)- On generalized Ramsey theory: The bipartite case
- Almost-spanning subgraphs with bounded degree in dense graphs
- Turán numbers and batch codes
- Packing tripods: narrowing the density gap
- Inverting the Turán problem
- Small dense subgraphs of a graph
- Turán problems for integer-weighted graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle
- Bipartite independence number in graphs with bounded maximum degree
- Extremal Parameters in Sub-Critical Graph Classes
- Extremal bipartite independence number and balanced coloring
- A note on internal partitions: the 5-regular case and beyond
- The fine structure of octahedron-free graphs
This page was built for publication: Extremal graphs with bounded densities of small subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242962)