Related papers: Entropy of Tournament Digraphs
A tournament is an orientation of a graph. Vertices are players and edges are games, directed away from the winner. Kannan, Tetali and Vempala and McShine showed that tournaments with given score sequence can be rapidly sampled, via simple…
Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…
Let M be a closed 3-dimensional graph manifold. We prove that h(g)>1 for each geometrization g of M, where h(g) is the topological entropy of geodesic flow of g.
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp…
An $n$-vertex graph is called $C$-Ramsey if it has no clique or independent set of size $C\log_2 n$ (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-statistics in Ramsey graphs, in particular obtaining very…
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…
This work studies the relation between two graph parameters, $\rho$ and $\Lambda$. For an undirected graph $G$, $\rho(G)$ is the growth rate of its universal covering tree, while $\Lambda(G)$ is a weighted geometric average of the vertex…
An oriented graph $D$ is converse invariant if, for any tournament $T$, the number of copies of $D$ in $T$ is equal to that of its converse $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph…
We give entropy estimates for two canonical non commutative shifts on $C^*$-algebras associated to some topological graphs $E=(E^0,E^1,s,r)$, defined using a basis of the corresponding Hilbert bimodule $H(E)$. We compare their entropies…
A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…
Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…
For a fixed finite set of finite tournaments ${\mathcal F}$, the ${\mathcal F}$-free orientation problem asks whether a given finite undirected graph $G$ has an $\mathcal F$-free orientation, i.e., whether the edges of $G$ can be oriented…
Let $G$ be a graph, and let $\rho\in (0,1)$. For a set $D$ of vertices of $G$, let the set $H_{\rho}(D)$ arise by starting with the set $D$, and iteratively adding further vertices $u$ to the current set if they have at least $\lceil \rho…
A tournament is an oriented complete graph. The problem of ranking tournaments was firstly investigated by P. Erd\H{o}s and J. W. Moon. By probabilistic methods, the existence of "unrankable" tournaments was proved. On the other hand, they…
In this article, we exhibit certain linking properties of periodic orbits of $C^{1+\alpha}$ flows with positive topological entropy on closed 3-manifolds M. It is shown that any such flow contains a link L of periodic orbits and a horseshoe…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
We investigate tournaments with a specified score vector having additional structure: loopy tournaments in which loops are allowed, Hankel tournaments which are tournaments symmetric about the Hankel diagonal (the anti-diagonal), and…