Bounding the number of edges in permutation graphs.
Keevash, Peter; Loh, Po-Shen; Sudakov, Benny
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R44, 9 p.-Research paper R44, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKeevash, Peter, Loh, Po-Shen, and Sudakov, Benny. "Bounding the number of edges in permutation graphs.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R44, 9 p.-Research paper R44, 9 p.. <http://eudml.org/doc/126513>.
@article{Keevash2006,
author = {Keevash, Peter, Loh, Po-Shen, Sudakov, Benny},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper R44, 9 p.-Research paper R44, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Bounding the number of edges in permutation graphs.},
url = {http://eudml.org/doc/126513},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Keevash, Peter
AU - Loh, Po-Shen
AU - Sudakov, Benny
TI - Bounding the number of edges in permutation graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R44, 9 p.
EP - Research paper R44, 9 p.
LA - eng
UR - http://eudml.org/doc/126513
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.