Polcyn, Joanna. "Large holes in quasi-random graphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R60, 12 p.-Research Paper R60, 12 p.. <http://eudml.org/doc/129773>.
@article{Polcyn2008,
author = {Polcyn, Joanna},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {quasi random graphs; density of large subsets; largest size empty subgraphs; largest size of complete bipartite induced subgraphs;; largest size of complete bipartite induced subgraphs},
language = {eng},
number = {1},
pages = {Research Paper R60, 12 p.-Research Paper R60, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Large holes in quasi-random graphs.},
url = {http://eudml.org/doc/129773},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Polcyn, Joanna
TI - Large holes in quasi-random graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R60, 12 p.
EP - Research Paper R60, 12 p.
LA - eng
KW - quasi random graphs; density of large subsets; largest size empty subgraphs; largest size of complete bipartite induced subgraphs;; largest size of complete bipartite induced subgraphs
UR - http://eudml.org/doc/129773
ER -
