Large sets must have either a $k$-edge or a $(k+2)$-edge

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Original language	English
Title of host publication	Towards a theory of geometric graphs
Publisher	American Mathematical Society
Pages	225-232
Number of pages	8
ISBN (Print)	0-8218-3484-3
DOIs	https://doi.org/10.1090/conm/342/06142
State	Published - 2004

Name	Contemporary Mathematics
Publisher	American Mathematical Society
Volume	342
ISSN (Print)	0271-4132

Access to Document

@inbook{6b661d41235f40f29354700b4d5ce477,

title = "Large sets must have either a $k$-edge or a $(k+2)$-edge",

author = "Perles, {Micha A.} and Rom Pinchasi",

year = "2004",

doi = "10.1090/conm/342/06142",

language = "אנגלית",

isbn = "0-8218-3484-3",

series = "Contemporary Mathematics",

publisher = "American Mathematical Society",

pages = "225--232",

booktitle = "Towards a theory of geometric graphs",

address = "ארצות הברית",

}

TY - CHAP

T1 - Large sets must have either a $k$-edge or a $(k+2)$-edge

AU - Perles, Micha A.

AU - Pinchasi, Rom

PY - 2004

Y1 - 2004

U2 - 10.1090/conm/342/06142

DO - 10.1090/conm/342/06142

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

SN - 0-8218-3484-3

T3 - Contemporary Mathematics

SP - 225

EP - 232

BT - Towards a theory of geometric graphs

PB - American Mathematical Society

ER -