Connected matchings and Hadwiger's conjecture

DOI10.1017/S0963548305006759zbMath1063.05104OpenAlexW2155950671WikidataQ123345994 ScholiaQ123345994MaRDI QIDQ4680576

Gábor Simonyi, András Gyárfás, Zoltan Fueredi

Publication date: 7 June 2005

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

Full work available at URL: https://doi.org/10.1017/s0963548305006759

zbMATH Keywords

minorindependence numberRamsey function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A note on the Hadwiger number of circular arc graphs ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ Multitasking Capacity: Hardness Results and Improved Constructions ⋮ Short proofs of some extremal results III

This page was built for publication: Connected matchings and Hadwiger's conjecture