Freie Universität Berlin

output

19922026

most citedHelical liquids and Majorana bound states in quantum wires

3.2k 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 2020 · math.COShow all

8 papers · 2 filters

math.CO2020★ 2 cited

Matrix patterns with bounded saturation function

Benjamin Aram Berendsohn

A 0-1 matrix $M$ contains a 0-1 matrix pattern $P$ if we can obtain $P$ from $M$ by deleting rows and/or columns and turning arbitrary 1-entries into 0s. The saturation function $\…

math.CO2020

Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions

Nathan Bowler, Christian Elbracht, Joshua Erde +4

A graph $G$ is said to be ubiquitous, if every graph $Γ$ that contains arbitrarily many disjoint $G$ -minors automatically contains infinitely many disjoint $G$ -minors. The well-kno…

math.CO2020★ 13 cited

Triangles in randomly perturbed graphs

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia +1

We study the problem of finding pairwise vertex-disjoint triangles in the randomly perturbed graph model, which is the union of any $n$ -vertex graph $G$ satisfying a given minimum…

math.CO2020★ 1 cited

The Neighborhood Polynomial of Chordal Graphs

Helena Bergold, Winfried Hochstättler, Uwe Mayer

We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its v…

math.CO2020★ 1 cited

Factors in randomly perturbed hypergraphs

Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2

We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a $k$ -graph $H$ with minimum vertex degree $Ω (n^{k - 1})$ to ensure an $F$ -…

math.CO2020★ 3 cited

Multivariate volume, Ehrhart, and $h^{*}$ -polynomials of polytropes

Marie-Charlotte Brandenburg, Sophia Elia, Leon Zhang

The univariate Ehrhart and $h^{*}$ -polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, E…

math.CO2020

Ramsey upper density of infinite graphs

Ander Lamaison

For a fixed infinite graph $H$ , we study the largest density of a monochromatic subgraph isomorphic to $H$ that can be found in every two-coloring of the edges of $K_{N}$ .…

math.CO2020

An almost optimal bound on the number of intersections of two simple polygons

Eyal Ackerman, Balázs Keszegh, Günter Rote

What is the maximum number of intersections of the boundaries of a simple $m$ -gon and a simple $n$ -gon, assuming general position? This is a basic question in combinatorial geometr…

Matrix patterns with bounded saturation function

Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions

Triangles in randomly perturbed graphs

The Neighborhood Polynomial of Chordal Graphs

Factors in randomly perturbed hypergraphs

Multivariate volume, Ehrhart, and h∗-polynomials of polytropes

Ramsey upper density of infinite graphs

An almost optimal bound on the number of intersections of two simple polygons

Multivariate volume, Ehrhart, and $h^{*}$ -polynomials of polytropes