Efficient covering designs of the complete graph

Yair Caro; Raphael Yuster

Efficient covering designs of the complete graph

Yair Caro
, Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Let H be a graph. We show that there exists n₀ = n₀(H) such that for every n ≥ n₀, there is a covering of the edges of K_n with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.

Original language	English
Pages (from-to)	XXV-XXVI
Journal	Electronic Journal of Combinatorics
Volume	4
Issue number	1
State	Published - 1997

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Cite this

@article{cf4fe7681add4d82921c3c0828c1f524,

title = "Efficient covering designs of the complete graph",

abstract = "Let H be a graph. We show that there exists n0 = n0(H) such that for every n ≥ n0, there is a covering of the edges of Kn with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.",

author = "Yair Caro and Raphael Yuster",

year = "1997",

language = "English",

volume = "4",

pages = "XXV--XXVI",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

T1 - Efficient covering designs of the complete graph

AU - Caro, Yair

AU - Yuster, Raphael

PY - 1997

Y1 - 1997

N2 - Let H be a graph. We show that there exists n0 = n0(H) such that for every n ≥ n0, there is a covering of the edges of Kn with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.

AB - Let H be a graph. We show that there exists n0 = n0(H) such that for every n ≥ n0, there is a covering of the edges of Kn with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.

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

M3 - Article

AN - SCOPUS:53249142558

SN - 1077-8926

VL - 4

SP - XXV-XXVI

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

Efficient covering designs of the complete graph

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this