Extremal graphs for two vertex-disjoint copies of a clique
type: Item
instance of: scholarly article
title: Extremal graphs for two vertex-disjoint copies of a clique
zbMATH Open document ID: 1485.05082
author: Yanyan Li
published in: Graphs and Combinatorics
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7493908
zbMATH Keywords: clique
zbMATH Keywords: Hajnal and Szemerédi theorem
zbMATH Keywords: extremal graph
MaRDI profile type: Publication
full work available at URL: s00373-022-02467-1
OpenAlex ID: W4220906523
cites work: The Turàn number of the graph 3P4
cites work: The Turán number of the graph \(2P_5\)
cites work: On maximal paths and circuits of graphs
cites work: On an extremal problem in graph theory.
cites work: Path Ramsey numbers in multicolorings
cites work: Q5620621
cites work: Q3852213
cites work: Extremal Numbers for Odd Cycles
cites work: On Independent Complete Subgraphs in a Graph
cites work: Q5548826
cites work: Q5781249
cites work: A review of goodness of fit tests for Pareto distributions
cites work: The Turán number of disjoint copies of paths
cites work: Turán numbers for disjoint paths
DOI: 10.1007/S00373-022-02467-1
description: scientific article; zbMATH DE number 7493908