On colorings of 3-homogeneous hypergraphs in 3 colors

DOI10.1007/s10958-020-05051-1zbMath1450.05022OpenAlexW3089471097MaRDI QIDQ2206279

I. A. Akolzin

Publication date: 22 October 2020

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-020-05051-1

zbMATH Keywords

combinatoricshypergraphcoloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• What we know and what we do not know about Turán numbers
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• A note on random greedy coloring of uniform hypergraphs
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II
• Colorings of hypergraphs with large number of colors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On colorings of 3-homogeneous hypergraphs in 3 colors