Efficient covering designs of the complete graph

Yair Caro; Raphael Yuster

doi:10.37236/1295

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_o = n _o(II) such that for every n ≥ n_o, there is a covering of the edges of K_n with copies of II 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
Article number	R10
Pages (from-to)	1-8
Number of pages	8
Journal	Electronic Journal of Combinatorics
Volume	4
Issue number	1 R
DOIs	https://doi.org/10.37236/1295
State	Published - 1997

ASJC Scopus subject areas

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

Access to Document

10.37236/1295

Cite this

@article{6acd9c040dae41e0af644c92ceec1a6a,

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

abstract = "Let H be a graph. We show that there exists no = n o(II) such that for every n ≥ no, there is a covering of the edges of Kn with copies of II 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",

doi = "10.37236/1295",

language = "English",

volume = "4",

pages = "1--8",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1 R",

}

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 no = n o(II) such that for every n ≥ no, there is a covering of the edges of Kn with copies of II 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 no = n o(II) such that for every n ≥ no, there is a covering of the edges of Kn with copies of II 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 - http://www.scopus.com/inward/record.url?scp=13744257868&partnerID=8YFLogxK

U2 - 10.37236/1295

DO - 10.37236/1295

M3 - Article

AN - SCOPUS:13744257868

SN - 1077-8926

VL - 4

SP - 1

EP - 8

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1 R

M1 - R10

ER -

Efficient covering designs of the complete graph

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this