Almost H-factors in dense graphs

Noga Alon; Raphael Yuster

doi:10.1007/BF02350627

Almost H-factors in dense graphs

Noga Alon, Raphael Yuster

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

38 Scopus citations

Abstract

The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree {Mathematical expression} contains (1-o(1))n/h vertex disjoint copies of H.

Original language	English (US)
Pages (from-to)	95-102
Number of pages	8
Journal	Graphs and Combinatorics
Volume	8
Issue number	2
DOIs	https://doi.org/10.1007/BF02350627
State	Published - Jun 1992
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF02350627

Cite this

@article{15f868c530c842c1acc216725142dec6,

title = "Almost H-factors in dense graphs",

abstract = "The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree \{Mathematical expression\} contains (1-o(1))n/h vertex disjoint copies of H.",

author = "Noga Alon and Raphael Yuster",

year = "1992",

month = jun,

doi = "10.1007/BF02350627",

language = "English (US)",

volume = "8",

pages = "95--102",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

TY - JOUR

T1 - Almost H-factors in dense graphs

AU - Alon, Noga

AU - Yuster, Raphael

PY - 1992/6

Y1 - 1992/6

N2 - The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree {Mathematical expression} contains (1-o(1))n/h vertex disjoint copies of H.

AB - The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree {Mathematical expression} contains (1-o(1))n/h vertex disjoint copies of H.

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

UR - https://www.scopus.com/inward/citedby.url?scp=0002178928&partnerID=8YFLogxK

U2 - 10.1007/BF02350627

DO - 10.1007/BF02350627

M3 - Article

AN - SCOPUS:0002178928

SN - 0911-0119

VL - 8

SP - 95

EP - 102

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 2

ER -

Almost H-factors in dense graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this