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 2017 · math.COShow all

8 papers · 2 filters

math.CO2017★ 3 cited

Cutting a part from many measures

Pavle V. M. Blagojević, Nevena Palić, Pablo Soberón +1

Holmsen, Kynčl and Valculescu recently conjectured that if a finite set $X$ with $ℓ n$ points in $R^{d}$ that is colored by $m$ different colors can be partitioned into $…

math.CO2017★ 2 cited

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and $k$

Simona Boyadzhiyska, Garth Isaak, Ann Trenk

A poset $P = (X, ≺)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_{x}$ so that $x ≺ y$ in $P$ if and only if $I_{x}$ lies completely to th…

math.CO2017★ 11 cited

Thieves can make sandwiches

Pavle V. M. Blagojević, Pablo Soberón

We prove a common generalization of the Ham Sandwich theorem and Alon's Necklace Splitting theorem. Our main results show the existence of fair distributions of $m$ measures in $R^…

math.CO2017★ 8 cited

Convex equipartitions of colored point sets

Pavle V. M. Blagojević, Günter Rote, Johanna K. Steinmeyer +1

We show that any $d$ -colored set of points in general position in $R^{d}$ can be partitioned into $n$ subsets with disjoint convex hulls such that the set of points and all…

math.CO2017

A Note on the Minimum Number of Edges in Hypergraphs with Property O

Gal Kronenberg, Christopher Kusch, Ander Lamaison +2

An oriented $k$ -uniform hypergraph is said to have Property O if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. Recently…

math.CO2017★ 1 cited

Burling graphs, chromatic number, and orthogonal tree-decompositions

Stefan Felsner, Gwenaël Joret, Piotr Micek +2

A classic result of Asplund and Grünbaum states that intersection graphs of axis-aligned rectangles in the plane are $χ$ -bounded. This theorem can be equivalently stated in terms o…

math.CO2017

Maximum Likelihood Threshold and Generic Completion Rank of Graphs

Grigoriy Blekherman, Rainer Sinn

The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold o…

math.CO2017

Separating Tree-chromatic number from Path-chromatic Number

Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros +4

We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~ $2$ while the path-chromatic number is unbounded. This resolves a…

Cutting a part from many measures

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and k

Thieves can make sandwiches

Convex equipartitions of colored point sets

A Note on the Minimum Number of Edges in Hypergraphs with Property O

Burling graphs, chromatic number, and orthogonal tree-decompositions

Maximum Likelihood Threshold and Generic Completion Rank of Graphs

Separating Tree-chromatic number from Path-chromatic Number

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and $k$