The power of many colours
From MaRDI portal
Publication:6652256
DOI10.1017/fms.2024.120MaRDI QIDQ6652256
Micha Christoph, Noga Alon, Michael Krivelevich, Matija Bucić
Publication date: 12 December 2024
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Generalized Ramsey theory (05C55) Ramsey theory (05D10) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Partitioning random graphs into monochromatic components
- Minimal coverings of pairs by triples
- Covering pairs by \(q^ 2+q+1\) sets
- Highly connected monochromatic subgraphs of two-colored complete graphs
- Highly connected coloured subgraphs via the regularity Lemma
- On the combinatorial problems which I would most like to see solved
- Golden ratios in a pairs covering problem
- Maximum degree and fractional matchings in uniform hypergraphs
- A generalization of Ramsey theory for graphs
- Matchings and covers in hypergraphs
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- Highly connected monochromatic subgraphs
- Highly connected multicoloured subgraphs of multicoloured graphs
- Discrepancies of spanning trees and Hamilton cycles
- The Difference Between Consecutive Primes, II
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Highly connected monochromatic subgraphs of multicolored graphs
- Poisson approximation for large deviations
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Adding random edges to dense graphs
- A Ramsey‐type problem and the Turán numbers*
- Partition relations for cardinal numbers
- Cycle lengths in randomly perturbed graphs
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths
- Set-coloring Ramsey numbers via codes
This page was built for publication: The power of many colours
