On the Turán number of edge blow-ups of cliques
From MaRDI portal
Publication:6606916
Recommendations
Cites work
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3298603 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal graphs for blow-ups of cycles and trees
- Extremal graphs for edge blow-up of graphs
- On Independent Complete Subgraphs in a Graph
- On maximal paths and circuits of graphs
- On the structure of linear graphs
- The Erdős‐Sós Conjecture for trees of diameter four
- The Turán number for the edge blow-up of trees: the missing case
Cited in
(2)
This page was built for publication: On the Turán number of edge blow-ups of cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606916)