Extremal graphs for two vertex-disjoint copies of a clique

DOI10.1007/S00373-022-02467-1zbMATH Open1485.05082OpenAlexW4220906523MaRDI QIDQ2117533FDOQ2117533

Authors: Yanyan Li 

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

Recommendations

• On generalized Turán number of two disjoint cliques
• Turán numbers for disjoint copies of graphs
• Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
• Generalized Turán problems for disjoint copies of graphs
• On the number of edge disjoint cliques in graphs of given size

zbMATH Keywords

cliqueextremal graphHajnal and Szemerédi theorem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path Ramsey numbers in multicolorings
• Title not available (Why is that?)
• Title not available (Why is that?)
• A review of goodness of fit tests for Pareto distributions
• On Independent Complete Subgraphs in a Graph
• The Turán number of the graph \(3P_4\)
• The Turán number of the graph \(2P_5\)
• On an extremal problem in graph theory.
• Extremal numbers for odd cycles
• The Turán number of disjoint copies of paths
• Turán numbers for disjoint paths

Cited In (5)

• 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}\)
• Turán number of two vertex-disjoint copies of cliques.
• Spectral extremal graphs for disjoint cliques

This page was built for publication: Extremal graphs for two vertex-disjoint copies of a clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117533)