Non-Jumping Numbers for 4-Uniform Hypergraphs

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.1, 2007-02, pp. : 97-110

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approximate Set Covering in Uniform Hypergraphs

By Krivelevich M.

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 118-143

Academic Press

Access to resources Recommend Favorite

Edge‐transitive homogeneous factorizations of complete uniform hypergraphs

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 305-316

John Wiley & Sons Inc

Access to resources Recommend Favorite

A note on random greedy coloring of uniform hypergraphs

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 407-413

John Wiley & Sons Inc

Access to resources Recommend Favorite

An approximate Dirac-type theorem for k-uniform hypergraphs

By Rödl Vojtěch Szemerédi Endre Ruciński Andrzej

Combinatorica, Vol. 28, Iss. 2, 2008-03 ,pp. : 229-260

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs

By Krivelevich M. Nathaniel R. Sudakov B.

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 99-113

Academic Press

Access to resources Recommend Favorite