Geodesic
Forestation in hypergraphs: Linear \(k\)-trees
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We present a new proof of a result of Lovász on the maximum number of edges in a $k$-forest. We also apply a construction used in our proof to generalize the notions of a $k$-hypertree and $k$-forest to a class which extends some properties of trees, to which both specialize when $k=2$.
DOI : 10.37236/1752
Classification : 05C65, 05E99 
@article{10_37236_1752,
     author = {Ojas Parekh},
     title = {Forestation in hypergraphs: {Linear} \(k\)-trees},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1752},
     zbl = {1024.05064},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1752/}
}
TY  - JOUR
AU  - Ojas Parekh
TI  - Forestation in hypergraphs: Linear \(k\)-trees
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1752/
DO  - 10.37236/1752
ID  - 10_37236_1752
ER  - 
%0 Journal Article
%A Ojas Parekh
%T Forestation in hypergraphs: Linear \(k\)-trees
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1752/
%R 10.37236/1752
%F 10_37236_1752
Ojas Parekh. Forestation in hypergraphs: Linear \(k\)-trees. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1752

Cité par Sources :