Asymptotically optimal tree-packings in regular graphs.
Kelmans, Alexander; Mubayi, Dhruv; Sudakov, Benny
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 1, page Research paper R38, 8 p.-Research paper R38, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKelmans, Alexander, Mubayi, Dhruv, and Sudakov, Benny. "Asymptotically optimal tree-packings in regular graphs.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R38, 8 p.-Research paper R38, 8 p.. <http://eudml.org/doc/122004>.
@article{Kelmans2001,
author = {Kelmans, Alexander, Mubayi, Dhruv, Sudakov, Benny},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {tree-packings; matchings in hypergraphs},
language = {eng},
number = {1},
pages = {Research paper R38, 8 p.-Research paper R38, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Asymptotically optimal tree-packings in regular graphs.},
url = {http://eudml.org/doc/122004},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Kelmans, Alexander
AU - Mubayi, Dhruv
AU - Sudakov, Benny
TI - Asymptotically optimal tree-packings in regular graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R38, 8 p.
EP - Research paper R38, 8 p.
LA - eng
KW - tree-packings; matchings in hypergraphs
UR - http://eudml.org/doc/122004
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.