Covering Graphs: The Covering Problem Solved

Yair Caro; Raphael Yuster

doi:10.1006/jcta.1998.2867

Covering Graphs: The Covering Problem Solved

Yair Caro
, Raphael Yuster

Department of Mathematics

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

Abstract

For every fixed graphH, we determine theH-covering number ofK_n, for alln>n₀(H). We prove that ifhis the number of edges ofH, andgcd(H)=dis the greatest common divisor of the degrees ofH, then there existsn₀=n₀(H), such that for alln>n₀,C(H,K_n)=dn2hn-1d,unlessdis even,n=1 moddandn(n-1)/d+1=0 mod(2h/d), in which case[formula]Our main tool in proving this result is the deep decomposition result of Gustavsson.

Original language	English
Pages (from-to)	273-282
Number of pages	10
Journal	Journal of Combinatorial Theory. Series A
Volume	83
Issue number	2
DOIs	https://doi.org/10.1006/jcta.1998.2867
State	Published - Aug 1998

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1006/jcta.1998.2867

Cite this

@article{4b53b2cc3240479aaaf6dbdcc171097d,

title = "Covering Graphs: The Covering Problem Solved",

abstract = "For every fixed graphH, we determine theH-covering number ofKn, for alln>n0(H). We prove that ifhis the number of edges ofH, andgcd(H)=dis the greatest common divisor of the degrees ofH, then there existsn0=n0(H), such that for alln>n0,C(H,Kn)=dn2hn-1d,unlessdis even,n=1 moddandn(n-1)/d+1=0 mod(2h/d), in which case[formula]Our main tool in proving this result is the deep decomposition result of Gustavsson.",

author = "Yair Caro and Raphael Yuster",

year = "1998",

month = aug,

doi = "10.1006/jcta.1998.2867",

language = "English",

volume = "83",

pages = "273--282",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Covering Graphs

T2 - The Covering Problem Solved

AU - Caro, Yair

AU - Yuster, Raphael

PY - 1998/8

Y1 - 1998/8

N2 - For every fixed graphH, we determine theH-covering number ofKn, for alln>n0(H). We prove that ifhis the number of edges ofH, andgcd(H)=dis the greatest common divisor of the degrees ofH, then there existsn0=n0(H), such that for alln>n0,C(H,Kn)=dn2hn-1d,unlessdis even,n=1 moddandn(n-1)/d+1=0 mod(2h/d), in which case[formula]Our main tool in proving this result is the deep decomposition result of Gustavsson.

AB - For every fixed graphH, we determine theH-covering number ofKn, for alln>n0(H). We prove that ifhis the number of edges ofH, andgcd(H)=dis the greatest common divisor of the degrees ofH, then there existsn0=n0(H), such that for alln>n0,C(H,Kn)=dn2hn-1d,unlessdis even,n=1 moddandn(n-1)/d+1=0 mod(2h/d), in which case[formula]Our main tool in proving this result is the deep decomposition result of Gustavsson.

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

U2 - 10.1006/jcta.1998.2867

DO - 10.1006/jcta.1998.2867

M3 - Article

AN - SCOPUS:0038901732

SN - 0097-3165

VL - 83

SP - 273

EP - 282

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

Covering Graphs: The Covering Problem Solved

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this