Multicolor containers, extremal entropy, and counting

DOI10.1002/rsa.20777zbMath1417.05104arXiv1801.05195OpenAlexW2963611066WikidataQ130024736 ScholiaQ130024736MaRDI QIDQ5229338

Victor Falgas-Ravry, Kelly O'Connell, Andrew J. Uzzell

Publication date: 14 August 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

entropyextremal graph theoryhereditary propertyhypergraph container method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Integer colorings with no rainbow 3-term arithmetic progression ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ Extremal problems for multigraphs ⋮ Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ Integer colorings with forbidden rainbow sums ⋮ On an extremal problem for locally sparse multigraphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Extremal Theory of Locally Sparse Multigraphs ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane

This page was built for publication: Multicolor containers, extremal entropy, and counting