Related papers: Tur\'{a}n numbers and switching
Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any…
Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$.…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
Let $D_k$ denote the tournament on $3k$ vertices consisting of three disjoint vertex classes $V_1, V_2$ and $V_3$ of size $k$, each of which is oriented as a transitive subtournament, and with edges directed from $V_1$ to $V_2$, from $V_2$…
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…
Recently, several hypergraph Tur\'{a}n problems were solved by the powerful random algebraic method. However, the random algebraic method usually requires some parameters to be very large, hence we are concerned about how these Tur\'{a}n…
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_n)_{n\in \mathbb{N}}$ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of $H$ in $T_n$ tends to…
The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Liu and Ma determined the Tur\'{a}n number of the edge blow-up…
Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…
The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…
Given a family $\mathcal{F}$ of $r$-graphs, the Tur\'{a}n number of $\mathcal{F}$ for a given positive integer $N$, denoted by $ex(N,\mathcal{F})$, is the maximum number of edges of an $r$-graph on $N$ vertices that does not contain any…
The Tur\'an number $\ex(n,H)$ is the maximum number of edges that an $n$-vertex $H$-free graph can have. The suspension $\widehat{H}$ is obtained from $H$ by adding a new vertex which is adjacent to all vertices of $H$ and a tree is…
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…
Linial and Morgenstern conjectured that, among all $n$-vertex tournaments with $d\binom{n}{3}$ cycles of length three, the number of cycles of length four is asymptotically minimized by a random blow-up of a transitive tournament with all…