Related papers: Entropy of Tournament Digraphs
Sumner's universal tournament conjecture states that every $(2n-2)$-vertex tournament should contain a copy of every $n$-vertex oriented tree. If we know the number of leaves of an oriented tree, or its maximum degree, can we guarantee a…
For two graphs $F$ and $H$, the relative Tur\'{a}n number $\mathrm{ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau \cite{FKP} and Perarnau and Reed \cite{PR} studied these…
Trigonometric and trigonometric-algebraic entropies are introduced. Regularity increases the entropy and the maximal entropy is shown to result when a regular $n$-gon is inscribed in a circle. A regular $n$-gon circumscribing a circle gives…
The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-R\'{e}nyi model, where it settles a conjecture of Hajek [IEEE…
The Erd\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\epsilon(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least…
The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the algorithm independently and uniformly at…
If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\cdot n^3$ cyclic triples for some $c>0$…
The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
In the standard random graph process, edges are added to an initially empty graph one by one uniformly at random. A classic result by Ajtai, Koml\'os, and Szemer\'edi, and independently by Bollob\'as, states that in the standard random…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a measure of how far is the tournament from being acyclic. The degreewidth of a tournament $T$ denoted by $\Delta(T)$ is the minimum value $k$…
It was recently shown that estimating the Shannon entropy $H({\rm p})$ of a discrete $k$-symbol distribution ${\rm p}$ requires $\Theta(k/\log k)$ samples, a number that grows near-linearly in the support size. In many applications $H({\rm…
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\alpha$-\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands…
A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…
Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Tur\'an number of H, RT_t(n, H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G where f(n) is larger than the maximum number of vertices in a…
We present a general holistic theory for the organization of complex networks, both human-engineered and naturally-evolved. Introducing concepts of value of interactions and satisfaction as generic network performance measures, we show that…
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random…