A lower bound for the number of edges in a graph containing no two cycles of the same length.
Lai, Chunhui
The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121633 
@article{01681025,
     title = {A lower bound for the number of edges in a graph containing no two cycles of the same length.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {8},
     year = {2001},
     zbl = {0981.05062},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01681025}
}

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], Tome 8 (2001) . http://gdmltest.u-ga.fr/item/01681025/