A graph whose edges only appear at certain points in time is called a temporal graph
(among other names). Such a graph is temporally connected if each ordered pair of vertices …

In this paper, we completely resolve the well-known problem of Erdős and Sauer from 1975
which asks for the maximum number of edges an n-vertex graph can have without …

How many edges in an nn‐vertex graph will force the existence of a cycle with as many
chords as it has vertices? Almost 30 years ago, Chen, Erdős and Staton considered this …

In 1975, Erd\H {o} s and Sauer asked to estimate, for any constant $ r $, the maximum
number of edges an $ n $-vertex graph can have without containing an $ r $-regular …

In 1975, Erd\H {o} s asked for the maximum number of edges that an $ n $-vertex graph can
have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that …

Given graphs and, a perfect-tiling in is a collection of vertex-disjoint copies of in that together
cover all the vertices in. The study of the minimum degree threshold forcing a perfect-tiling in …

An edge‐ordered graph is a graph with a linear ordering of its edges. Two edge‐ordered
graphs are equivalent if there is an isomorphism between them preserving the edge …

In this paper we initiate a systematic study of the Turán problem for edge-ordered graphs. A
simple graph is called edge-ordered if its edges are linearly ordered. This notion allows us …

We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is,
graphs with linearly ordered sets of edges. The edge-ordered Ramsey number R¯ e (G) of …

We introduce the Tur\'an problem for edge ordered graphs. We call a simple graph\emph
{edge ordered}, if its edges are linearly ordered. An isomorphism between edge ordered …