Towards a Weighted Version of the Hajnal–Szemerédi Theorem

DOI10.1017/S0963548313000059zbMath1263.05049arXiv1206.1376MaRDI QIDQ4921565

Graeme Kemkes, József Balogh, Stephen J. Young, Choongbum Lee

Publication date: 13 May 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1376

zbMATH Keywords

minimum degreeperfect \(K_r\)-packing for edge-weighted graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

Triangle factors of graphs without large independent sets and of weighted graphs

Cites Work

• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• On the maximal number of independent circuits in a graph

This page was built for publication: Towards a Weighted Version of the Hajnal–Szemerédi Theorem