Sufficient conditions for perfect mixed tilings

01/11/2022
by   Eoin Hurley, et al.
0

We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs H with components of sublinear order. As a corollary, we recover and extend the work of Kühn and Osthus regarding sufficient minimum degree conditions for perfect F-tilings (for an arbitrary fixed graph F) by replacing the F-tiling with the aforementioned graphs H. Moreover, we obtain analogous results for degree sequences and in the setting of uniformly dense graphs. Finally, we asymptotically resolve a conjecture of Komlós in a strong sense.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2023

Sufficient conditions for the surjectivity of radical curve parametrizations

In this paper, we introduce the notion of surjective radical parametriza...
research
01/06/2021

Perfect domination, Roman domination and perfect Roman domination in lexicographic product graphs

The aim of this paper is to obtain closed formulas for the perfect domin...
research
03/01/2019

On the Existence of Perfect Splitter Sets

Given integers k_1, k_2 with 0< k_1<k_2, the determinations of all posit...
research
12/21/2022

Gadget construction and structural convergence

Nešetřil and Ossona de Mendez recently proposed a new definition of grap...
research
05/19/2017

Optimal prevention with possibilistic and mixed background risk

In this paper the effect of posibilistic or mixed background risk on the...
research
02/19/2020

Holistic Specifications for Robust Programs

Functional specifications describe what program components do: the suffi...
research
02/07/2018

Strong Amplifiers of Natural Selection: Proofs

We consider the modified Moran process on graphs to study the spread of ...

Please sign up or login with your details

Forgot password? Click here to reset