Extremal numbers for disjoint copies of a clique

DOI10.1016/j.dam.2024.01.003OpenAlexW4391121615WikidataQ129390868 ScholiaQ129390868MaRDI QIDQ6202950

Junxue Zhang

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.003

zbMATH Keywords

extremal graphsTurán numbersdisjoint cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for equitable coloring
• On an extremal problem in graph theory.
• Equitable coloring of trees
• Equitable coloring and the maximum degree
• On equitable coloring of bipartite graphs
• Extremal graphs for two vertex-disjoint copies of a clique
• On generalized Turán number of two disjoint cliques
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
• On maximal paths and circuits of graphs
• Equitable Coloring
• Generalized Turán results for intersecting cliques

This page was built for publication: Extremal numbers for disjoint copies of a clique