Number of the records: 1

Packing Degenerate Graphs Greedily

SYSNO ASEP	0477019
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve SCOPUS
Title	Packing Degenerate Graphs Greedily
Author(s)	Allen, P. (GB) Böttcher, J. (GB) Hladký, J. (DE) Piguet, Diana (UIVT-O)_{RID, ORCID, SAI}
Source Title	Electronic Notes in Discrete Mathematics. - : Elsevier - ISSN 1571-0653 Roč. 61, August (2017), s. 45-51
Number of pages	7 s.
Language	eng - English
Country	NL - Netherlands
Keywords	tree packing conjecture ; graph packing ; graph processes
Subject RIV	BA - General Mathematics
OECD category	Pure mathematics
R&D Projects	GJ16-07822Y GA ČR - Czech Science Foundation (CSF)
Institutional support	UIVT-O - RVO:67985807
EID SCOPUS	85026746699
DOI	10.1016/j.endm.2017.06.019
Annotation	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.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2018

Number of the records: 1