2008
DOI: 10.48550/arxiv.0812.2366
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Some algebraic properties of hypergraphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
0
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
1
0
0
Order By: Relevance
“…As mentioned in Example 4.8, there are clutters such that every subclutter contains a complete-neighborhood vertex, but that are not chordal. We can however use a similar technique to show that clutters with a complete-neighborhood vertex in every induced subclutter are vertex decomposable, improving the previous result [14,Theorem 4.3] that such clutters are shellable: Proposition 6.11. Let C be a d-uniform clutter such that every induced subclutter has a complete-neighborhood vertex.…”
Section: Alexander Duals Of Complements To Chordal Clutterssupporting
confidence: 55%
“…As mentioned in Example 4.8, there are clutters such that every subclutter contains a complete-neighborhood vertex, but that are not chordal. We can however use a similar technique to show that clutters with a complete-neighborhood vertex in every induced subclutter are vertex decomposable, improving the previous result [14,Theorem 4.3] that such clutters are shellable: Proposition 6.11. Let C be a d-uniform clutter such that every induced subclutter has a complete-neighborhood vertex.…”
Section: Alexander Duals Of Complements To Chordal Clutterssupporting
confidence: 55%