A. Vetta

activity

20122026

most citedThe Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems

11 citations · 25 across the 25 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

Discrete-time treatment number

N. E. Clarke, K. L. Collins, M. E. Messinger +2

We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our…

math.CO2024

$k$ -Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$

Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye +1

A graph $G = (V, E)$ is a $k$ -leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and o…

math.CO2023

One n Remains to Settle the Tree Conjecture

Jack Dippel, Adrian Vetta

In the famous network creation game of Fabrikant et al. a set of agents play a game to build a connected graph. The $n$ agents form the vertex set $V$ of the graph and each vertex…

Discrete-time treatment number

k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k≥5

One n Remains to Settle the Tree Conjecture

$k$ -Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$