D. Yager

collaborators

5 papers

physics.soc-ph2017

Congestion Barcodes: Exploring the Topology of Urban Congestion Using Persistent Homology

Yu Wu, Gabriel Shindnes, Vaibhav Karve +4

This work presents a new method to quantify connectivity in transportation networks. Inspired by the field of topological data analysis, we propose a novel approach to explore the…

math.CO2015

On the Bandwidth of the Kneser Graph

Tao Jiang, Zevi Miller, Derrek Yager

Let $G = (V, E)$ be a graph on $n$ vertices and $f : V \to [1, n]$ a one to one map of $V$ onto the integers $1$ through $n$ . Let $d i l a t i o n (f) =$ max$\{ |f(v) - f(w)|: vw\in E…

math.CO2015

Toward Żak's conjecture on graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

Two graphs $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ , each of order $n$ , pack if there exists a bijection $f$ from $V_{1}$ onto $V_{2}$ such that $uv \in E_{1}$ implies…

math.CO2015

Graphs with induced-saturation number zero

Sarah Behrens, Catherine Erbes, Michael Santana +2

Given graphs $G$ and $H$ , $G$ is $H$ -saturated if $H$ is not a subgraph of $G$ , but for all $e \in / E (G)$ , $H$ appears as a subgraph of $G + e$ . While for every $n \geq ∣ V (H) ∣$ , t…

math.CO2015

A list version of graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \cup V_{2}, E_{3})$ …