A note about monochromatic components in graphs of large minimum degree

DOI10.7151/DMGT.2390MaRDI QIDQ6985994zbMATH OpenFDO

Authors Louis DeBiasio, Robert A. Krueger

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2390

zbMATH Keywords

block designsfractional matchingsRamsey theory

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex degrees (05C07) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Transversal (matching) theory (05D15)

Cites work

• Covering the complete graph by partitions
• scientific article; zbMATH DE number 3815655 (Why is no real title available?)
• scientific article; zbMATH DE number 874488 (Why is no real title available?)
• scientific article; zbMATH DE number 3430675 (Why is no real title available?)
• Large monochromatic components in 3-colored non-complete graphs
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Large monochromatic components in multicolored bipartite graphs
• Matching theory
• Monochromatic components in edge-coloured graphs with large minimum degree
• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• The existence of resolvable BIBD with \(\lambda=1\)

This page was built for publication: A note about monochromatic components in graphs of large minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985994)