Florian Lehner's user avatar
Florian Lehner's user avatar
Florian Lehner's user avatar
Florian Lehner
  • Member for 6 years, 3 months
  • Last seen this week
14 votes
Accepted

Tiling with similar tiles

12 votes

Tiling a rectangle with all simply connected polyominoes of fixed size

9 votes

Smallest family of subsets that generates the discrete topology

7 votes
Accepted

pursuit-evasion based on Schroeder's upper bound for graphs of genus $g$

7 votes

Chromatic numbers of infinite abelian Cayley graphs

6 votes

Strict unfriendly partitions

5 votes
Accepted

Random walks on infinite directed regular graphs

5 votes

When is it true that if $G$ is isomorphic to a spanning subgraph of $H$ and vice versa, then $G$ is isomorphic to $H$?

5 votes

Does there exist a non-recurrent acyclic graph with sublinear expansion?

5 votes
Accepted

Are there more paths exiting a box in $\mathbb{Z}^2$ to the right if I remove some edges to the left

5 votes

Tiling with similar tiles

5 votes
Accepted

Looking for examples showing that the crossing number may not be realized by the drawings with local crossing number

5 votes

Hamilton cycles in $\{0,1\}^n$ with fixed Hamming distance

4 votes
Accepted

Existence of connected set with large edge boundary

4 votes
Accepted

Asymptotics of orbits on graphs

4 votes
Accepted

Maximum number of edges in "square" hypergraph

4 votes
Accepted

Shortcutting quasigeodesics

4 votes
Accepted

A diameter 2 arc-transitive graph whose complement is not arc-transitive?

4 votes
Accepted

Avoiding multiply covered vertices in graph edge coverings

4 votes
Accepted

$\omega$-Hamilton paths in $\mathbb{Z}^n$

4 votes
Accepted

Percolation on finite irregular trees

3 votes

Representability of "large" graphs by "small" intersection graphs

3 votes

A permutation problem for finite subsets of an abelian group

3 votes

Convexity of the expectation of boolean functions

3 votes
Accepted

Changing tiles by swapping squares

3 votes
Accepted

"Roundtrip"-chromatic number of (connected) graphs

3 votes

Sabidussi theorem for morphisms between graphs

3 votes
Accepted

Discrepancy number of a graph

3 votes

Filling cups and buckets continuously

3 votes

Matching number in infinite hypergraphs