Extremal numbers for disjoint copies of a clique (Q6202950): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q129390868, #quickstatements; #temporary_batch_1726262144271 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Equitable coloring of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable coloring and the maximum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal graphs for two vertex-disjoint copies of a clique / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an extremal problem in graph theory. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized Turán results for intersecting cliques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620621 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for equitable coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On equitable coloring of bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equitable Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5546739 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5548826 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5781249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized Turán number of two disjoint cliques / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129390868 / rank | |||
Normal rank |
Latest revision as of 22:28, 13 September 2024
scientific article; zbMATH DE number 7809939
Language | Label | Description | Also known as |
---|---|---|---|
English | Extremal numbers for disjoint copies of a clique |
scientific article; zbMATH DE number 7809939 |
Statements
Extremal numbers for disjoint copies of a clique (English)
0 references
27 February 2024
0 references
Turán numbers
0 references
extremal graphs
0 references
disjoint cliques
0 references