Partitioning the power set of \([n]\) into \(C_k\)-free parts
From MaRDI portal
Publication:2323815
zbMath1419.05025arXiv1812.06448MaRDI QIDQ2323815
Ronen Wdowinski, Robert A. Krueger, Eben Blaisdell, András Gyárfás
Publication date: 12 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.06448
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a packing and covering problem
- The edge-coloring of complete hypergraphs. I
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- Ramsey numbers of Berge-hypergraphs and related structures
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Extremal Results for Berge Hypergraphs