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

9 papers · 2 filters

math.CO2021★ 1 cited

Growth of Replacements

Vuong Bui

The following game in a similar formulation to Petri nets and chip-firing games is studied: Given a finite collection of baskets, each has an infinite number of balls of the same v…

math.CO2021★ 1 cited

A fast algorithm on average for solving the Hamilton Cycle problem

Michael Anastos

We present CertifyHAM, an algorithm which takes as input a graph G and either finds a Hamilton cycle of G or it outputs that such a cycle does not exists. If G=G(n, p) and p >2000/…

math.CO2021

Bivariate Chromatic Polynomials of Mixed Graphs

Matthias Beck, Sampada Kolhatkar

The bivariate chromatic polynomial $χ_{G} (x, y)$ of a graph $G = (V, E)$ , introduced by Dohmen-Pönitz-Tittmann (2003), counts all $x$ -colorings of $G$ such that adjacent vertices get…

math.CO2021

Counting Gray codes for an improved upper bound of the Grünbaum-Hadwiger-Ramos problem

Jonathan Kliem

We give an improved upper bound for the Grünbaum--Hadwiger--Ramos problem: Let $d, n, k \in N$ such that $d \geq 2^{n} (1 + 2^{k - 1})$ . Given $2^{n + 1}$ masses on $R^{d}$ , t…

math.CO2021★ 1 cited

Embedding dimensions of simplicial complexes on few vertices

Florian Frick, Mirabel Hu, Verity Scheel +1

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$ -sphere. Namely, a simplicial complex on $d + 3$ vertices embeds into the $d$ -sphe…

math.CO2021★ 2 cited

Edge Partitions of Complete Geometric Graphs (Part 1)

Johannes Obenaus, Joachim Orthaber

In this paper, we disprove the long-standing conjecture that any complete geometric graph on $2 n$ vertices can be partitioned into $n$ plane spanning trees. Our construction is bas…

math.CO2021★ 1 cited

On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time

Michael Anastos

We prove that for $k + 1 \geq 3$ and $c > (k + 1) /2$ w.h.p. the random graph on $n$ vertices, $c n$ edges and minimum degree $k + 1$ contains a (near) perfect $k$ -matching. As an immediate c…

math.CO2021★ 1 cited

An exact characterization of saturation for permutation matrices

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.CO2021★ 1 cited

Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra

Sophie Rehberg

Generalized permutahedra are a class of polytopes with many interesting combinatorial subclasses. We introduce pruned inside-out polytopes, a generalization of inside-out polytopes…