Large monochromatic components in expansive hypergraphs

DOI10.1017/S096354832400004XzbMATH Open1548.05107MaRDI QIDQ6632815

Deepak Bal, Louis DeBiasio

Publication date: 5 November 2024

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

zbMATH Keywords

hypergraphscolouringsmonochromatic components

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Cites Work

• Title not available (Why is that?)
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning random graphs into monochromatic components
• Large monochromatic components in 3-colored non-complete graphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Large monochromatic components and long monochromatic cycles in random hypergraphs
• Large monochromatic components in almost complete graphs and bipartite graphs
• Monochromatic components in edge-coloured graphs with large minimum degree
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Large Cross-Free Sets in Steiner Triple Systems
• A Ramsey property of random regular and k‐out graphs
• On some Multicolor Ramsey Properties of Random Graphs
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• Path Ramsey Number for Random Graphs
• Large monochromatic components in hypergraphs with large minimum codegree
• Large monochromatic components in 3‐edge‐colored Steiner triple systems

This page was built for publication: Large monochromatic components in expansive hypergraphs

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