Induced trees in triangle-free graphs.
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper R41, 9 p.-Research Paper R41, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topMatousek, Jirí, and Sámal, Robert. "Induced trees in triangle-free graphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R41, 9 p.-Research Paper R41, 9 p.. <http://eudml.org/doc/129766>.
@article{Matousek2008,
author = {Matousek, Jirí, Sámal, Robert},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {connected triangle free graph; number of vertices of an induced tree; upper bound; blow-up construction;; blow-up construction},
language = {eng},
number = {1},
pages = {Research Paper R41, 9 p.-Research Paper R41, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Induced trees in triangle-free graphs.},
url = {http://eudml.org/doc/129766},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Matousek, Jirí
AU - Sámal, Robert
TI - Induced trees in triangle-free graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R41, 9 p.
EP - Research Paper R41, 9 p.
LA - eng
KW - connected triangle free graph; number of vertices of an induced tree; upper bound; blow-up construction;; blow-up construction
UR - http://eudml.org/doc/129766
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.