Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on near-optimal coloring of shift hypergraphs

From MaRDI portal
Publication:3467579
Jump to:navigation, search

DOI10.1002/rsa.20565zbMath1330.05067OpenAlexW2087365287MaRDI QIDQ3467579

Aravind Srinivasan, David G. Harris

Publication date: 3 February 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20565


zbMATH Keywords

Lovász local lemmahypergraph coloringshift hypergraphs


Mathematics Subject Classification ID

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


Related Items (2)

Max-norm Ramsey theory ⋮ Polychromatic Colorings on the Integers




Cites Work

  • Unnamed Item
  • A constructive proof of the general lovász local lemma
  • Approximating theDomatic Number
  • Graph colouring and the probabilistic method




This page was built for publication: A note on near-optimal coloring of shift hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3467579&oldid=29985521"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 March 2024, at 16:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki