84 citations · 438 across the 47 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
Full subgraphs
Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte
Let be a graph of density on vertices. Following Erdős, Łuczak and Spencer, an -vertex subgraph of is called {\em full} if has minimum degree at le…
math.CO2015
On 1-sum flows in undirected graphs
S. Akbari, S. Friedland, K. Markström +1
Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed b…