Geodesic
A note on graphs without short even cycles
The electronic journal of combinatorics, Tome 12 (2005)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note, we show that any $n$-vertex graph without even cycles of length at most $2k$ has at most ${1\over2}n^{1 + 1/k} + O(n)$ edges, and polarity graphs of generalized polygons show that this is asymptotically tight when $k \in \{2,3,5\}$.
DOI : 10.37236/1972
Classification : 05C38, 05C35
Mots-clés : polarity graphs, polygons 
@article{10_37236_1972,
     author = {Thomas Lam and Jacques Verstra\"ete},
     title = {A note on graphs without short even cycles},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1972},
     zbl = {1060.05057},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1972/}
}
TY  - JOUR
AU  - Thomas Lam
AU  - Jacques Verstraëte
TI  - A note on graphs without short even cycles
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1972/
DO  - 10.37236/1972
ID  - 10_37236_1972
ER  - 
%0 Journal Article
%A Thomas Lam
%A Jacques Verstraëte
%T A note on graphs without short even cycles
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1972/
%R 10.37236/1972
%F 10_37236_1972
Thomas Lam; Jacques Verstraëte. A note on graphs without short even cycles. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1972

Cité par Sources :