Algorithmic characterizations of interval ordered hypergraphs and applications
β Scribed by A. Quilliot; Sun Xiao Chao
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 817 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
To a regular hypergraph we attach an operator, called its adjacency matrix, and study the second largest eigenvalue as well as the overall distribution of the spectrum of this operator. Our definition and results extend naturally what is known for graphs, including the analogous threshold bound 2 -k
We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co