Induced complete -partite graphs in dense clique-less graphs.
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper R43, 3 p.-Research paper R43, 3 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topFischer, Eldar. "Induced complete -partite graphs in dense clique-less graphs.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper R43, 3 p.-Research paper R43, 3 p.. <http://eudml.org/doc/120181>.
@article{Fischer1999,
author = {Fischer, Eldar},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {clique; Ramsey; complete bipartite},
language = {eng},
number = {1},
pages = {Research paper R43, 3 p.-Research paper R43, 3 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Induced complete -partite graphs in dense clique-less graphs.},
url = {http://eudml.org/doc/120181},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Fischer, Eldar
TI - Induced complete -partite graphs in dense clique-less graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper R43, 3 p.
EP - Research paper R43, 3 p.
LA - eng
KW - clique; Ramsey; complete bipartite
UR - http://eudml.org/doc/120181
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.