A Ramsey-type theorem for the matching number regarding connected graphs

DOI10.1016/J.DISC.2019.111648zbMath1429.05137arXiv1808.04540OpenAlexW2975708916WikidataQ112880933 ScholiaQ112880933MaRDI QIDQ2279970

Ringi Kim, Michitaka Furuya, Ilkyoo Choi, Boram Park

Publication date: 17 December 2019

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

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

zbMATH Keywords

matching numberRamsey-type theoreminduced matching number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Connectivity (05C40)

Related Items (3)

Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Ramsey-type results for path covers and path partitions

Cites Work

• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• Typical subgraphs of 3- and 4-connected graphs
• Forbidden induced subgraphs for bounded \(p\)-intersection number
• The difference and ratio of the fractional matching number and the matching number of graphs
• Graph parameters and Ramsey theory
• Unavoidable doubly connected large graphs
• New results on maximum induced matchings in bipartite graphs and beyond
• Graph Theory
• Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
• Forbidden subgraphs for constant domination number
• Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets

This page was built for publication: A Ramsey-type theorem for the matching number regarding connected graphs