Neighborly families of boxes and bipartite coverings

Noga Alon

doi:10.1007/978-1-4614-7254-4_2

Neighborly families of boxes and bipartite coverings

Noga Alon

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

1 Scopus citations

Abstract

A bipartite covering of order k of the complete graph K_n on n vertices is a collection of complete bipartite graphs so that every edge of K_n lies in at least 1 and at most k of them. It is shown that the minimum possible number of subgraphs in such a collection is Θ(kn^1/k). This extends a result of Graham and Pollak, answers a question of Felzenbaum and Perles, and has some geometric consequences. The proofs combine combinatorial techniques with some simple linear algebraic tools.

Original language	English
Title of host publication	The Mathematics of Paul Erdos II, Second Edition
Publisher	Springer New York
Pages	15-20
Number of pages	6
ISBN (Electronic)	9781461472544
ISBN (Print)	9781461472537
DOIs	https://doi.org/10.1007/978-1-4614-7254-4_2
State	Published - 1 Jan 2013
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/978-1-4614-7254-4_2

Cite this

@inbook{273cd4075b8a4a0c83aa303b16fe3dfe,

title = "Neighborly families of boxes and bipartite coverings",

abstract = "A bipartite covering of order k of the complete graph Kn on n vertices is a collection of complete bipartite graphs so that every edge of Kn lies in at least 1 and at most k of them. It is shown that the minimum possible number of subgraphs in such a collection is Θ(kn1/k). This extends a result of Graham and Pollak, answers a question of Felzenbaum and Perles, and has some geometric consequences. The proofs combine combinatorial techniques with some simple linear algebraic tools.",

author = "Noga Alon",

note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media New York 2013.",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-1-4614-7254-4\_2",

language = "English",

isbn = "9781461472537",

pages = "15--20",

booktitle = "The Mathematics of Paul Erdos II, Second Edition",

publisher = "Springer New York",

address = "United States",

}

TY - CHAP

T1 - Neighborly families of boxes and bipartite coverings

AU - Alon, Noga

PY - 2013/1/1

Y1 - 2013/1/1

N2 - A bipartite covering of order k of the complete graph Kn on n vertices is a collection of complete bipartite graphs so that every edge of Kn lies in at least 1 and at most k of them. It is shown that the minimum possible number of subgraphs in such a collection is Θ(kn1/k). This extends a result of Graham and Pollak, answers a question of Felzenbaum and Perles, and has some geometric consequences. The proofs combine combinatorial techniques with some simple linear algebraic tools.

AB - A bipartite covering of order k of the complete graph Kn on n vertices is a collection of complete bipartite graphs so that every edge of Kn lies in at least 1 and at most k of them. It is shown that the minimum possible number of subgraphs in such a collection is Θ(kn1/k). This extends a result of Graham and Pollak, answers a question of Felzenbaum and Perles, and has some geometric consequences. The proofs combine combinatorial techniques with some simple linear algebraic tools.

UR - https://www.scopus.com/pages/publications/84956679651

U2 - 10.1007/978-1-4614-7254-4_2

DO - 10.1007/978-1-4614-7254-4_2

M3 - Chapter

AN - SCOPUS:84956679651

SN - 9781461472537

SP - 15

EP - 20

BT - The Mathematics of Paul Erdos II, Second Edition

PB - Springer New York

ER -

Neighborly families of boxes and bipartite coverings

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this