Panchromatic 3-coloring of a random hypergraph
type: Item
instance of: scholarly article
title: Panchromatic 3-coloring of a random hypergraph
zbMATH Open document ID: 1378.05063
author: Dmitry Kravtsov
author: Nikolay Krokhmal
author: D. A. Shabanov
publication date: 2018-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6827253
zbMATH Keywords: random hypergraph
zbMATH Keywords: panchromatic colorings
zbMATH Keywords: second moment method
MaRDI profile type: Publication
full work available at URL: j.endm.2017.07.036
OpenAlex ID: W2744636876
cites work: Q4074927
cites work: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
cites work: On a generalization of Rubin's theorem
cites work: Two‐coloring random hypergraphs
cites work: Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
cites work: On the chromatic number of a random hypergraph
cites work: Sharp thresholds for constraint satisfaction problems and homomorphisms
DOI: 10.1016/J.ENDM.2017.07.036
description: scientific article; zbMATH DE number 6827253