
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
The famous Lovász Local Lemma was derived in the paper of P. Erdős and Lovász to prove that any _n_uniform non_r_colorable hypergraph _H_ has maximum edge degree at least
_Δ(H) ≥ ¼ r_<sup>_n−1_</sup>.
A long series of papers is devoted to the improvement of this classical result for different classesof uniform hypergraphs.
In our work we deal with colorings of simple hypergraphs, i.e. hypergraphs in which everytwo distinct edges do not share more than one vertex. By using a multipass random recoloringwe show that any simple _n_uniform non_r_colorable hypergraph _H_ has maximum edge degree at least
_Δ(H) ≥ с · nr_<sup>_n−1_</sup>
where _c_ > 0 is an absolute constant. We also give some applications of our probabilistic technique, we establish a new lower bound for the Van der Waerden number and extend the main result to the _b_simple case.
The work of the second author was supported by Russian Foundation of Fundamental Research (grant № 120100683a), by the program “Leading Scientific Schools” (grant no. NSh2964.2014.1) and by the grant of the President of Russian Federation MK692.2014.1
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment