<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform hypergraphs: if H has no isolated vertex, then in terms of the degrees, and for triangle-free linear H in terms of the order and average degree.</p></abstract>

Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform hypergraphs: if H has no isolated vertex, then in terms of the degrees, and for triangle-free linear H in terms of the order and average degree.

On vertex independence number of uniform hypergraphs

University of Kashmir Department of Mathematics Srinagar, India

Nanjing University Department of Mathematics Nanjing, China

Eötvös Loránd University Faculty of Informatics Budapest, Hungary

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

{"article-title":"On vertex independence number of uniform hypergraphs"}

Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform...

On vertex independence number of uniform hypergraphs

Published Online: Jun 27, 2014

Page range: 132 - 158

Received: Jan 15, 2014

DOI: https://doi.org/10.2478/ausi-2014-0022

Keywords
uniform hypergraph, independence number, lower bound

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

On vertex independence number of uniform hypergraphs

Published Online: Jun 27, 2014

Page range: 132 - 158

Received: Jan 15, 2014

DOI: https://doi.org/10.2478/ausi-2014-0022

Keywordsuniform hypergraph, independence number, lower bound

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Keywords
uniform hypergraph, independence number, lower bound