# Tagged Questions

**1**

vote

**0**answers

80 views

### On 'Very Movable' Geometric Configurations (Configurations with a large degree of freedom)

Let $C$ be an $(n_r, b_k)$ combinatorial configuration that admits a geometric realization in the plane. I'm interested in the maximum number of points/lines $M$ of $C$ we can place in general ...

**0**

votes

**1**answer

146 views

### Expected length of the shortest polygonal chain connecting N random points in the unit square

N points are selected uniformly at random in the unit square. Let L(N) be the expected length of the shortest (possibly self-intersecting) polygonal chain connecting all the points. It can be proved ...

**4**

votes

**0**answers

143 views

### Unique Domino Tiling

Question: how does one enumerate all star-convex $2n$-vertex sublattices of the plane that have the unique domino-tiling property?
Definitions:
A subset S of the xy-plane is star-convex if there is ...

**11**

votes

**3**answers

368 views

### Is there a nice way to “unravel” a great dodecahedron?

The great dodecahedron is a non-convex regular polyhedron bounded by 12 pentagonal faces, crossing each other, arranged in a star-shaped manner around each of its 12 vertices (see the Wikipedia page ...

**5**

votes

**1**answer

435 views

### Difference Sets

Suppose
$$
P \subseteq \{1,2,\dots,N\},\quad |P| = K
$$
We calculate the differences as: $$d=p_i-p_j\mod N,\quad i\ne j$$
Now let $a_d$ denote the number of occurrence of $d$ (for $d = 1, 2, \dots , N ...

**6**

votes

**1**answer

254 views

### When is a 0-1 matrix a one-intersection incidence matrix?

The following problem is what motivated my previous MO question.
It is easily seen that for any given 0-1 matrix $M$, one can always find
a set $\mathcal P$ of points, and a set $\mathcal C$ of ...

**4**

votes

**3**answers

217 views

### Perimeter/Neighborhood of a graph on grid

Hello,
I have a $\sqrt{n}\times\sqrt{n}$ lattice graph $G=(V,E)$ i.e. vertices on said 2-dim integer lattice, and two vertices have an edge if their $L_1$ distance is one.
Now I want to claim ...

**2**

votes

**1**answer

234 views

### Ways to look at a polyhedral graph

Motivation
There are at least three interpretations of an abstract polyhedral (= planar 3-vertex-connected) graph:
the 1-skeleton of a convex polyhedron (when embedded into $\mathbb{R}^3$)
a ...

**2**

votes

**2**answers

224 views

### What is the smallest number of subsets in such a subdivision?

Given any $30$ points in the plane, what is the smallest number of
subsets in a subdivision of the set of $30$ points into subsets such
that all the points in each subset are on the boundary of the ...

**0**

votes

**1**answer

212 views

### Is this bounded?

May be better to ask for help here. Let $v_{1}$, $v_{2}$, $\ldots$, $v_{m}$ be the vertices of a
convex polygon in the plane and $v_{m+1}$ be a vertex in the interior
of the convex polygon. Connect ...

**15**

votes

**0**answers

432 views

### Monomer-Dimer tatami tilings need better relationships with other math. Summary of results.

A monomer-dimer tiling of a rectangular grid with $r$ rows and $c$ columns satisfies the \emph{tatami} condition if no four tiles meet at any point. (or you can think of it as the removal of a ...

**1**

vote

**1**answer

370 views

### Combinatorial optimization and graph coloring

I am considering the following problem:
(i) Fix $n$ and color the edges of $K_n$ red and blue arbitrarily.
(ii) Let $M$ be the set of monochromatic triangles in $K_n$ and define $g:M\rightarrow ...

**4**

votes

**2**answers

240 views

### Isostatic graphs and the Henneberg conjecture

I have been reading "Combinatorial Rigidity" by Graver, Servatius and Servatius and I am interested in their chapter on rigidity in dimension $\geq$ 3. I have two questions.
What is the current ...

**6**

votes

**2**answers

499 views

### Maximal number of edges and triangular cells for n points in a triangular lattice

Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points.
What is the maximum, over all such subsets, of the number of edges? This ...

**2**

votes

**1**answer

302 views

### When are nontopological bistellar flips manifold-preserving?

A topological bistellar flip is the term used by Dougherty, Faber, and Murphy to describe a bistellar flip that does not cause any face of a complex to be duplicated. Suppose we consider a ...

**10**

votes

**1**answer

378 views

### Random geometric graphs and spanners

I would grateful to learn of work mixing
random geometric graphs with random graphs under
the
Erdős-Renyi model, and in particular concerning spanners.
Select $n$ points uniformly at random from the ...

**2**

votes

**1**answer

186 views

### Are combinatorial configurations whose Levi graphs may be represented as covering graphs over voltage graphs realizable with pseudolines?

This question is related to this previous question. Many combinatorial configurations have Levi graphs which may be represented as derived graphs obtained from voltage graphs over a cyclic group; in a ...

**2**

votes

**0**answers

254 views

### Drawing a combinatorial 3-configuration of points and lines with pseudolines

This question is related to the question of drawing a combinatorial 3-configuration of points and lines with straight lines. We only relax the condition and admit drawings with pseudolines. Let us ...

**11**

votes

**2**answers

593 views

### Drawing 3-configurations of points and lines with straight lines

It is well-known that the black-and-white coloring of the Heawood graph on 14 vertices determines a combinatorial 3-configuration with 7 "points" and 7 "lines", known as Fano plane. Similarly, any ...