Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userReconstruction of small graphs and tournaments
58
0
0.0
(
0
)
Authors
Brendan D. McKay
Ask ChatGPT about the research
No Arabic abstract
We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructability of tournaments up to 13 vertices and posets up to 13 points. In all cases, our proofs also apply to the set reconstruction problem that uses the isomorph-reduced deck.
rate research
Read More
Let $S_k(n)$ be the maximum number of orientations of an $n$-vertex graph $G$ in which no copy of $K_k$ is strongly connected. For all integers $n$, $kgeq 4$ where $ngeq 5$ or $kgeq 5$, we prove that $S_k(n) = 2^{t_{k-1}(n)}$, where $t_{k-1}(n)$ is the number of edges of the $n$-vertex $(k-1)$-partite Turan graph $T_{k-1}(n)$, and that $T_{k-1}(n)$ is the only $n$-vertex graph with this number of orientations. Furthermore, $S_4(4) = 40$ and this maximality is achieved only by $K_4$.
In 1976, Alspach, Mason, and Pullman conjectured that any tournament $T$ of even order can be decomposed into exactly ${rm ex}(T)$ paths, where ${rm ex}(T):= frac{1}{2}sum_{vin V(T)}|d_T^+(v)-d_T^-(v)|$. We prove this conjecture for all sufficiently large tournaments. We also prove an asymptotically optimal result for tournaments of odd order.
We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal construction. It is an unbalanced blow-up of an edge, where the sink vertex is replaced by a quasi-random tournament and the source vertex is iteratively replaced by a copy of the construction itself.
In this short note we prove that every tournament contains the $k$-th power of a directed path of linear length. This improves upon recent results of Yuster and of Gir~ao. We also give a complete solution for this problem when $k=2$, showing that there is always a square of a directed path of length $lceil 2n/3 rceil-1$, which is best possible.
We consider a generalisation of Kellys conjecture which is due to Alspach, Mason, and Pullman from 1976. Kellys conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kuhn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number of paths needed in a path decomposition of a general tournament $T$. There is a natural lower bound for this number in terms of the degree sequence of $T$ and it is conjectured that this bound is correct for tournaments of even order. Almost all cases of the conjecture are open and we prove many of them.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
