A lower bound for the number of edges in a graph containing no two cycles of the same length.

Lai, Chunhui. "A lower bound for the number of edges in a graph containing no two cycles of the same length.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper N9, 6 p.-Research paper N9, 6 p.. <http://eudml.org/doc/121633>.

@article{Lai2001,
author = {Lai, Chunhui},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {cycle length},
language = {eng},
number = {1},
pages = {Research paper N9, 6 p.-Research paper N9, 6 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A lower bound for the number of edges in a graph containing no two cycles of the same length.},
url = {http://eudml.org/doc/121633},
volume = {8},
year = {2001},
}

TY - JOUR
AU - Lai, Chunhui
TI - A lower bound for the number of edges in a graph containing no two cycles of the same length.
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 N9, 6 p.
EP - Research paper N9, 6 p.
LA - eng
KW - cycle length
UR - http://eudml.org/doc/121633
ER -