On vertex independence number of uniform hypergraphs

  • Chishti T
  • Zhou G
  • Pirzada S
  • et al.
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Chishti, T. A., Zhou, G., Pirzada, S., & Iványi, A. (2014). On vertex independence number of uniform hypergraphs. Acta Universitatis Sapientiae, Informatica, 6(1), 132–158. https://doi.org/10.2478/ausi-2014-0022

Readers over time

‘16‘17‘20‘2201234

Readers' Seniority

Tooltip

Lecturer / Post doc 2

33%

PhD / Post grad / Masters / Doc 2

33%

Professor / Associate Prof. 1

17%

Researcher 1

17%

Readers' Discipline

Tooltip

Mathematics 4

67%

Agricultural and Biological Sciences 1

17%

Computer Science 1

17%

Save time finding and organizing research with Mendeley

Sign up for free
0