Universität Ulm

output

19942026

most citedArea laws for the entanglement entropy - a review

2.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2016 · math.COShow all

7 papers · 2 filters

math.CO2016

Large Values of the Clustering Coefficient

Michael Gentner, Irene Heinrich, Simon Jäger +1

A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is t…

math.CO2016★ 2 cited

Long cycles have the edge-Erdős-Pósa property

Henning Bruhn, Matthias Heinlein, Felix Joos

We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer $ℓ \geq 3$ and every $k \in N$ , every graph $G$ either contains $k$ edge-disj…

math.CO2016★ 20 cited

A unified Erdős-Pósa theorem for constrained cycles

Tony Huynh, Felix Joos, Paul Wollan

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $Γ_{1}, Γ_{2}$ . A cycle in a doubly group-labeled graph is $(Γ_1,Γ_2…

math.CO2016★ 10 cited

The Cheeger constant of a quantum graph

James B. Kennedy, Delio Mugnolo

We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.

math.CO2016

Chromatic index, treewidth and maximum degree

Henning Bruhn, Laura Gellert, Richard Lang

We conjecture that any graph $G$ with treewidth~ $k$ and maximum degree $Δ (G) \geq k + k$ satisfies $χ^{'} (G) = Δ (G)$ . In support of the conjecture we prove its fractional version.…

math.CO2016★ 1 cited

Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees

Michael Gentner, Dieter Rautenbach

Let $G$ be a graph, and let $ρ \in (0, 1)$ . For a set $D$ of vertices of $G$ , let the set $H_{ρ} (D)$ arise by starting with the set $D$ , and iteratively adding further vertices $u$ to…

math.CO2016★ 18 cited

How to determine if a random graph with a fixed degree sequence has a giant component

Felix Joos, Guillem Perarnau, Dieter Rautenbach +1

For a fixed degree sequence $D = (d_{1}, ..., d_{n})$ , let $G (D)$ be a uniformly chosen (simple) graph on ${1, ..., n}$ where the vertex $i$ has degree $d_{i}$ . In this p…