相关论文: 1-color-avoiding paths, special tournaments, and i…

The oriented Ramsey number $\vec{r}(H)$ for an acyclic digraph $H$ is the minimum integer $n$ such that any $n$-vertex tournament contains a copy of $H$ as a subgraph. We prove that the $1$-subdivision of the $k$-vertex transitive…

We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\'ark\"ozy: the vertex set of every $2$-edge-colored graph can be…

A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of…

A Gallai coloring of the complete graph is an edge-coloring with no rainbow triangle. This concept first appeared in the study of comparability graphs and anti-Ramsey theory. We introduce a transitive analogue for acyclic directed graphs,…

We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$-dimensional $n$-vertex acyclic tournaments. In addition, we prove that every $n$-vertex…

The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…

A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). As shown by Gy\'arf\'as and P\'alv\H{o}lgyi this result…

We extend the list of tournaments $S$ for which the complete structural description for tournaments excluding $S$ as a subtournament is known. Specifically, let $\Delta(1, 2, 2)$ be a tournament on five vertices obtained from a cyclic…

In this thesis we prove a variety of theorems on tournaments. A \emph{prime} tournament is a tournament $G$ such that there is no $X \subseteq V(G)$, $1 < |X| < |V(G)|$, such that for every vertex $v \in V(G) \minus X$, either $v \ra x$ for…

Using a switching operation on tournaments we obtain some new lower bounds on the Tur\'{a}n number of the $r$-graph on $r+1$ vertices with $3$ edges. For $r=4$, extremal examples were constructed using Paley tournaments in previous work. We…

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

We propose a purely combinatorial quadratic time algorithm that for any $n$-vertex $P_{k}$-free tournament $T$, where $P_{k}$ is a directed path of length $k$, finds in $T$ a transitive subset of order $n^{\frac{c}{k\log(k)^{2}}}$. As a…

We prove the following new results. (a) Let $T$ be a regular tournament of order $2n+1\geq 11$ and $S$ a subset of $V(T)$. Suppose that $|S|\leq \frac{1}{2}(n-2)$ and $x$, $y$ are distinct vertices in $V(T)\setminus S$. If the subtournament…

Since the seminal result of Karger, Motwani, and Sudan, algorithms for approximate 3-coloring have primarily centered around SDP-based rounding. However, it is likely that important combinatorial or algebraic insights are needed in order to…

We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by K\"uhn…

The chromatic number of a directed graph is the minimum number of induced acyclic subdigraphs that cover its vertex set, and accordingly, the chromatic number of a tournament is the minimum number of transitive subtournaments that cover its…

We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…

Given a graph $G$, we consider a game where two players, $A$ and $B$, alternatingly color edges of $G$ in red and in blue respectively. Let $l(G)$ be the maximum number of moves in which $B$ is able to keep the red and the blue subgraphs…

We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have…

A vertex colouring of a graph $G$ is "nonrepetitive" if $G$ contains no path for which the first half of the path is assigned the same sequence of colours as the second half. Thue's famous theorem says that every path is nonrepetitively…