The complete value of the Turán number of 3K_p+1
From MaRDI portal
Publication:6204352
Recommendations
Cites work
- A proof for a conjecture of Gorgol
- Equitable and proportional coloring of trees
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Extremal graphs for two vertex-disjoint copies of a clique
- Graph theory with applications
- scientific article; zbMATH DE number 3652374 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On Independent Complete Subgraphs in a Graph
- On maximal paths and circuits of graphs
- On the Turán number of forests
- Path Ramsey numbers in multicolorings
- The Turán number of \(k \cdot S_\ell \)
- The Turán number of disjoint copies of paths
- The Turán number of star forests
- The Turán number of the graph \(2P_5\)
- The Turán number of the graph \(3P_4\)
- Turán numbers for disjoint copies of graphs
- Turán numbers for disjoint paths
- Turán numbers of multiple paths and equibipartite forests
Cited in
(4)
This page was built for publication: The complete value of the Turán number of \(3K_{p+1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204352)