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_____%2F19%3A00498771" target="_blank" >RIV/67985807:_____/19:00498771 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/19:00331841
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2018.11.004" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2018.11.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2018.11.004" target="_blank" >10.1016/j.ejc.2018.11.004</a>
Alternative languages
Result language
angličtina
Original language name
A Median-Type Condition for Graph Tiling
Original language description
Komlós (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. 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>imp</sub> - Article in a specialist periodical, which is included in the Web of Science 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
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
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
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
77
Issue of the periodical within the volume
March
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
90-101
UT code for WoS article
000457669000008
EID of the result in the Scopus database
2-s2.0-85058411663