A Median-Type Condition for Graph Tiling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00477018" target="_blank" >RIV/67985807:_____/17:00477018 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.07.062" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.07.062</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.07.062" target="_blank" >10.1016/j.endm.2017.07.062</a>
Alternative languages
Result language
angličtina
Original language name
A Median-Type Condition for Graph Tiling
Original language description
Komlós [Komlós: Tiling Turán Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H. We show that the minimum degree condition can be relaxed in the sense that we require only a given fraction of vertices to have the prescribed degree.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GJ16-07822Y" target="_blank" >GJ16-07822Y: Extremal graph theory and applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Notes in Discrete Mathematics
ISSN
1571-0653
e-ISSN
—
Volume of the periodical
61
Issue of the periodical within the volume
August
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
979-985
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85026742513