23 citations · 54 across the 45 of their papers we have counts for
Showing 2015 · math.COShow all
3 papers · 2 filters
math.CO2015
A tournament approach to pattern avoiding matrices
Asaf Shapira, Raphy Yuster
We consider the following Turán-type problem: given a fixed tournament , what is the least integer so that adding edges to any -vertex tournament, results in a…
math.CO2015
Constructing Near Spanning Trees with Few Local Inspections
Reut Levi, Guy Moshkovitz, Dana Ron +2
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following var…
math.CO2015
Decomposing a Graph Into Expanding Subgraphs
Guy Moshkovitz, Asaf Shapira
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to be…