Turán number of two vertex-disjoint copies of cliques.
From MaRDI portal
Publication:6648066
DOI10.21136/CMJ.2024.0461-23MaRDI QIDQ6648066
Publication date: 4 December 2024
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turán numbers for disjoint copies of graphs
- The Turán number of the graph \(2P_5\)
- On an extremal problem in graph theory.
- Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
- Extremal graphs for blow-ups of cycles and trees
- A note on the Turán number of disjoint union of wheels
- Hypergraph Turán numbers of vertex disjoint cycles
- Extremal graphs for two vertex-disjoint copies of a clique
- Extremal graphs of the \(p\)th power of paths
- The Turán number of disjoint copies of paths
- Extremal problems for directed graphs
- Extremal graphs for edge blow-up of graphs
- On maximal paths and circuits of graphs
- Extremal graphs for the k‐flower
- The Turàn number of the graph 3P4
- Extremal Numbers for Odd Cycles
- On Independent Complete Subgraphs in a Graph
- On the structure of linear graphs
- Turán numbers for disjoint paths
- Extremal graphs for odd wheels
This page was built for publication: Turán number of two vertex-disjoint copies of cliques.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648066)
