Colouring set families without monochromatic \(k\)-chains

DOI10.1016/j.jcta.2019.05.014zbMath1421.05041arXiv1803.09573OpenAlexW2795206231MaRDI QIDQ2326327

Yanyan Li

Publication date: 7 October 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Sperner's theorem\((r, k)\)-colourings\(k\)-chainsErdős-Rothschild problems

Mathematics Subject Classification ID

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

Related Items

Remarks on an edge-coloring problem ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Integer colorings with forbidden rainbow sums ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with many Kneser colorings
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• Hypergraph containers
• A structural result for hypergraphs with many restricted edge colorings
• A coloring problem for intersecting vector spaces
• Maximum number of sum-free colorings in finite abelian groups
• Colourings without monochromatic disjoint pairs
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Logarithmic order of free distributive lattice
• Maximum-size antichains in random set-systems
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
• A short proof of Sperner's lemma
• A Dual of Dilworth's Decomposition Theorem
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• On a lemma of Littlewood and Offord