Coloring the cube with rainbow cycles
From MaRDI portal
Publication:1953479
zbMath1266.05039arXiv1212.1646MaRDI QIDQ1953479
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1646
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (2)
Cites Work
- Unnamed Item
- Rainbows in the hypercube
- Theorems in the additive theory of numbers
- An improved construction of progression-free sets
- An anti-Ramsey theorem on cycles
- A Note on Elkin’s Improvement of Behrend’s Construction
- A Ramsey-type result for the hypercube
- Polychromatic Colorings of Subcubes of the Hypercube
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Rainbow coloring the cube
- Solving a linear equation in a set of integers I
- Solving a linear equation in a set of integers II
- Turán’s Theorem in the Hypercube
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication: Coloring the cube with rainbow cycles