Name
Abstract | ||
|---|---|---|
A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the connectivity-related notion of tightness for hypergraphs introduced by Arocha, Bracho and Neumann-Lara in, we provide an example of a saturated, i.e. inclusion-maximal 3-forest that is not tight. This resolves an open problem posed by Strausz. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | discrete mathematics,graph theory |
Field | DocType | Volume |
Graph theory,Discrete mathematics,Combinatorics,Open problem,Constraint graph,Mathematics | Journal | abs/1109.3390 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heidi Gebauer | 1 | 83 | 11.07 |
| Anna Gundert | 2 | 14 | 3.05 |
| Robin A. Moser | 3 | 240 | 12.51 |
| Yoshio Okamoto | 4 | 7 | 1.85 |