Extremal graphs for two vertex-disjoint copies of a clique
From MaRDI portal
Publication:2117533
DOI10.1007/s00373-022-02467-1zbMath1485.05082OpenAlexW4220906523MaRDI QIDQ2117533
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02467-1
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Extremal numbers for disjoint copies of a clique ⋮ The complete value of the Turán number of \(3K_{p+1}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Turán number of the graph \(2P_5\)
- On an extremal problem in graph theory.
- Path Ramsey numbers in multicolorings
- A review of goodness of fit tests for Pareto distributions
- The Turán number of disjoint copies of paths
- On maximal paths and circuits of graphs
- The Turàn number of the graph 3P4
- Extremal Numbers for Odd Cycles
- On Independent Complete Subgraphs in a Graph
- Turán numbers for disjoint paths
This page was built for publication: Extremal graphs for two vertex-disjoint copies of a clique
