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

7 papers · 2 filters

math.CO2016★ 12 cited

Planar posets have dimension at most linear in their height

Gwenaël Joret, Piotr Micek, Veit Wiechert

We prove that every planar poset $P$ of height $h$ has dimension at most $192 h + 96$ . This improves on previous exponential bounds and is best possible up to a constant factor. We…

math.CO2016★ 5 cited

Colourings without monochromatic disjoint pairs

Dennis Clemens, Shagnik Das, Tuan Tran

The typical extremal problem asks how large a structure can be without containing a forbidden substructure. The Erdős-Rothschild problem, introduced in 1974 by Erdős and Rothschild…

math.CO2016

Proper colouring Painter-Builder game

Małgorzata Bednarska-Bzdęga, Michael Krivelevich, Viola Mészáros +1

We consider the following two-player game, parametrised by positive integers $n$ and $k$ . The game is played between Painter and Builder, alternately taking turns, with Painter mov…

math.CO2016★ 2 cited

The Finiteness Threshold Width of Lattice Polytopes

Mónica Blanco, Christian Haase, Jan Hofmann +1

We prove that in each dimension $d$ there is a constant $w^{\infty} (d) \in N$ such that for every $n \in N$ all but finitely many $d$ -polytopes with $n$ lattice point…

math.CO2016★ 3 cited

The poset of rational cones

Joseph Gubeladze, Mateusz Michałek

We introduce a natural partial order on the set Cones(d) of rational cones in R^d. The poset NPol(d-1) of normal polytopes in R^{d-1} embeds into Cones(d) via the homogenization ma…

math.CO2016★ 1 cited

Strong Ramsey Games: Drawing on an infinite board

Dan Hefetz, Christopher Kusch, Lothar Narins +3

We consider the strong Ramsey-type game $R^{(k)} (H, ℵ_{0})$ , played on the edge set of the infinite complete $k$ -uniform hypergraph $K_{N}^{k}$ . Two p…

math.CO2016

Sharp thresholds for half-random games II

Jonas Groschwitz, Tibor Szabó

We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case…