Projects per year
Abstract
Given graphs F and G, a perfect Ftiling in G is a collection of vertexdisjoint copies of F in G that together cover all the vertices in G. The study of the minimum degree threshold forcing a perfect Ftiling in a graph G has a long history, culminating in the Kühn–Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs F. We initiate the study of the analogous question for edgeordered graphs. In particular, we characterize for which edgeordered graphs F this problem is welldefined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect Ptiling in an edgeordered graph, where P is any fixed monotone path.
Original language  English 

Title of host publication  EUROCOMB’23 
Publisher  Masaryk University Press 
Pages  18 
Number of pages  8 
DOIs  
Publication status  Published  28 Aug 2023 
Event  European Conference on Combinatorics, Graph Theory and Applications  Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic Duration: 28 Aug 2023 → 1 Sept 2023 https://iuuk.mff.cuni.cz/events/conferences/eurocomb23/ 
Publication series
Name  European Conference on Combinatorics, Graph Theory and Applications 

Publisher  Masaryk University Press 
Number  12 
ISSN (Electronic)  27883116 
Conference
Conference  European Conference on Combinatorics, Graph Theory and Applications 

Abbreviated title  EUROCOMB'23 
Country/Territory  Czech Republic 
City  Prague 
Period  28/08/23 → 1/09/23 
Internet address 
Fingerprint
Dive into the research topics of 'Tiling problems in edgeordered graphs'. Together they form a unique fingerprint.Projects
 1 Finished

Matchings and tilings in graphs
Engineering & Physical Science Research Council
1/03/21 → 29/02/24
Project: Research Councils