Related papers: One n Remains to Settle the Tree Conjecture
We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest…
The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays first, to maximize the weights on their respective claimed…
We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which there is a guessing strategy on each vertex that only…
The celebrated Nash-Williams and Tutte's theorem states that a graph $G=(V, E)$ contains $k$ edge disjoint spanning trees if and only if $\nu_{f}(G) \geq k$, where $$\nu_{f}(G):=\min_{|\mathcal{\mathcal{P}}|>1, \text{$\mathcal{P}$ is a…
In the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner tree on the current set of vertices. The cost of the tree is the total length of edges in the tree, and we want…
Assuming the Unique Games Conjecture, we show strong inapproximability results for two natural vertex deletion problems on directed graphs: for any integer $k\geq 2$ and arbitrary small $\epsilon > 0$, the Feedback Vertex Set problem and…
The Tree Augmentation Problem (TAP) is a fundamental network design problem in which we are given a tree and a set of additional edges, also called \emph{links}. The task is to find a set of links, of minimum size, whose addition to the…
Suppose that pebbles are distributed on the vertices of a graph G. A pebbling step along an edge uv removes two pebbles from u and places one pebble on v. We introduce two new graph parameters: stack(G): the least integer t such that every…
Edge connectivity of a graph is one of the most fundamental graph-theoretic concepts. The celebrated tree packing theorem of Tutte and Nash-Williams from 1961 states that every $k$-edge connected graph $G$ contains a collection $\cal{T}$ of…
Chernyshev, Rauch and Rautenbach [Discrete Math., 2025] introduce forest cuts, i.e., vertex separators that induce a forest. They conjecture that, similar to a result by Chen and Yu [Discrete Math., 2002], every $n$-vertex graph with less…
As a variant of the much studied Tur\'an number, $ex(n,F)$, the largest number of edges that an $n$-vertex $F$-free graph may contain, we introduce the connected Tur\'an number $ex_c(n,F)$, the largest number of edges that an $n$-vertex…
The Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \subseteq E$ such that $(V,{\cal E} \cup F)$ is $2$-edge-connected. In the conference version…
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games…
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…
We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…
We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in choosing edges emanating from the vertex they are currently…
We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…
We show that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every $n$ vertex triangulation has a spanning tree with at least $11n/21$ leaves. Prior to the current work, the best known…
In this paper we extend a popular non-cooperative network creation game (NCG) to allow for disconnected equilibrium networks. There are n players, each is a vertex in a graph, and a strategy is a subset of players to build edges to. For…
Graph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one…