A note on near-optimal coloring of shift hypergraphs (Q3467579): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
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.1002/rsa.20565 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2087365287 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4878282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating theDomatic Number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph colouring and the probabilistic method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructive proof of the general lovász local lemma / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:38, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on near-optimal coloring of shift hypergraphs |
scientific article |
Statements
A note on near-optimal coloring of shift hypergraphs (English)
0 references
3 February 2016
0 references
Lovász local lemma
0 references
shift hypergraphs
0 references
hypergraph coloring
0 references