English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection ofvertex-disjoint copies of $F$ in $G$ that together cover all the vertices in$G$. The study of the minimum degree threshold forcing a perfect $F$-tiling ina graph $G$ has a long history, culminating in the K\"uhn--Osthus theorem[Combinatorica 2009] which resolves this problem, up to an additive constant,for all graphs $F$. In this paper we initiate the study of the analogousquestion for edge-ordered graphs. In particular, we characterize for whichedge-ordered graphs $F$ this problem is well-defined. We also apply theabsorbing method to asymptotically determine the minimum degree threshold forforcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixedmonotone path.

Tiling edge-ordered graphs with monotone paths and other structures