Packing Degenerate Graphs Greedily
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00477019" target="_blank" >RIV/67985807:_____/17:00477019 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.019" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.06.019</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.019" target="_blank" >10.1016/j.endm.2017.06.019</a>
Alternative languages
Result language
angličtina
Original language name
Packing Degenerate Graphs Greedily
Original language description
We prove that if G is a family of graphs with at most n vertices each, with constant degeneracy, with maximum degree at most O(n/log n), and with total number of edges at most (1-o(1)) n^2/2, then G packs into the complete graph on n vertices.
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
45-51
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85026746699