Panchromatic 3-coloring of a random hypergraph (Q1690010): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q314148
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2017.07.036 / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy A. Shabanov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.07.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2744636876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Rubin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two‐coloring random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds for constraint satisfaction problems and homomorphisms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2017.07.036 / rank
 
Normal rank

Latest revision as of 03:52, 11 December 2024

scientific article
Language Label Description Also known as
English
Panchromatic 3-coloring of a random hypergraph
scientific article

    Statements

    Identifiers