The existence of panchromatic colourings for uniform hypergraphs
From MaRDI portal
Publication:3577778
DOI10.1070/SM2010V201N04ABEH004084zbMATH Open1221.05163OpenAlexW2151422544MaRDI QIDQ3577778FDOQ3577778
Authors: D. A. Shabanov
Publication date: 23 July 2010
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm2010v201n04abeh004084
Recommendations
Cited In (12)
- On a generalization of Rubin's theorem
- Improper choosability and property B
- Density conditions for panchromatic colourings of hypergraphs
- Panchromatic colorings of random hypergraphs
- Extremal problems for panchromatic colourings of uniform hypergraphs
- Panchromatic 3-colorings of random hypergraphs
- Extremal problems in hypergraph colourings
- On the \(s\)-colorful number of a random hypergraph
- Chain method for panchromatic colorings of hypergraphs
- Random constructions of hypergraphs with large girth and without panchromatic colorings
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
- A note on panchromatic colorings
This page was built for publication: The existence of panchromatic colourings for uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577778)