✦ LIBER ✦

Colorings of uniform hypergraphs with large girth

✍ Scribed by A. B. Kupavskii, D. A. Shabanov

Book ID: 114993256
Publisher: SP MAIK Nauka/Interperiodica
Year: 2012
Tongue: English
Weight: 193 KB
Volume: 85
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s106456241202024x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large monochromatic components in colori

Large monochromatic components in colorings of complete 3-uniform hypergraphs

✍ András Gyárfás; Penny Haxell 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 419 KB

On general two-colorings of uniform hype

On general two-colorings of uniform hypergraphs

✍ A. P. Rozovskaya 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 152 KB

Fractional colorings of cubic graphs wit

Fractional colorings of cubic graphs with large girth

✍ Kardoš, František; Král’, Daniel; Volec, Jan 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 242 KB

Approximate coloring of uniform hypergra

Approximate coloring of uniform hypergraphs

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 194 KB

On colorings of non-uniform hypergraphs

On colorings of non-uniform hypergraphs without short cycles

✍ A.P. Rozovskaya; D.A. Shabanov 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 206 KB

UniquelyH-colorable graphs with large gi

UniquelyH-colorable graphs with large girth

✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph