Bounding the number of edges in permutation graphs.
Keevash, Peter ; Loh, Po-Shen ; Sudakov, Benny
The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:126513 
@article{05050762,
     title = {Bounding the number of edges in permutation graphs.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {13},
     year = {2006},
     zbl = {1098.05042},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05050762}
}

Keevash, Peter; Loh, Po-Shen; Sudakov, Benny. Bounding the number of edges in permutation graphs.. The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006) . http://gdmltest.u-ga.fr/item/05050762/