Suppose that we are given positive integers $p$, $q$, $V$, $E$, $F$, a closed surface $S$ and the Euler characteristic $\chi(S)$ of that surface. Suppose that we also know that the following relations hold: $$ qV=2E=pF\\ V-E+F=\chi(S).\tag{$\star$} $$ A regular tessellation $\{p,q\}$ is a tessellation by $p$-gons where $q$ tiles meet in every vertex. Or, using graph theory terms, an embedded $q$-regular graph whose dual is $p$-regular.
With the information above, can we say that there is a regular tessellation $\{p,q\}$ on $S$.
It is well known that if a regular tessellation $\{p,q\}$ of $S$ exists, then the relations $(\star)$ hold. So they are necessary. What I'm asking is: Are they also known to be sufficient.
If the answer turns out to be highly nontrivial, then I would also like to ask for a reference.
Edit 1:
An idea popped into my head, to reformulate things. We start with a $q$-regualr graph with $V$ vertices and $E=\frac{qV}2$ edges. Can we then always choose a rotation system $R$, such that we get $F=\frac{qV}p$ $p\text{-gonal}$ faces? (Remember that $p$, $q$, $V$, $E$, $F$ are given.)
The questions that must be answered in this case are:
- Can we always draw a $q$-regular graph with $V$ vertices and $E=\frac{qV}2$ edges?
- Can we always give this graph a the rotation system $R$ described above?
Does this make the problem any more feasible?
Edit 2:
As mentioned in the comments, there is an natural relation with tessellations of the hyperbolic plane and Poincaré's (polygon) Theorem.
The road to walk in this case looks, to the best of my understanding, like this:
- Consider the $\{p,q\}$ tessellation of the hyperbolic plane ($\mathbb D$).
- Try to find a simply-connected subset $P$ of this tessellation consisting of $F$ $p$-gons. Say the border of $P$ consists of $Z$ sides (each side of $P$ should be an edge of a $p$-gon).
- Find suitable side pairing for $P$. Suitable, meaning they turn $P$ into $S$.
The questions that must now be answered are:
- Can we always make a simply-connected $P$, consisting of $F$ $p$-gons such that the number of vertices and edges are "correct".
- Can we then also find suitable side pairings?
This method is the least fruitful in my opinion. Notice how the two questions to be answered here are intertwined (the number of vertices and edged is dependent on the side pairings). I already found that this is a very useful heuristic method, but it probably doen't help that much to find a genral answer. I included it here to show that I've already tried it and to point out its weak spots.
Edit 3:
I'm starting to think that a general proof currently might not exist. So if you can show that it holds for "a lot" of cases, I would very much like to see that. (I am contemplating making this a conjecture, so it will help to be able to say something about its likelihood.)