Related papers: The 1-2-3 conjecture for polygonal tilings

We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have…

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\in \mathbb{N}$ with $a_1+a_2+a_3\leq n-2$, we show there exists a matching $M$ of $G$ with…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Tilings are around us everywhere, and our curiosity draws us to study their properties. A tiling is a way of arranging pieces on a board, such that there is no space left uncovered, nor any space covered by more than one tile. In…

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

In this paper, we investigate semilinear elliptic equations with general exponential-type nonlinearities in two dimensions. For such nonlinearities, we establish two main results. The first is the construction of a singular solution.…

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

In this paper, we prove existence results of a one-dimensional periodic solution to equations with the fractional Laplacian of order $s\in(1/2,1)$, singular nonlinearity, and gradient term under various situations, including nonlocal…

A perfect $K_r$-tiling in a graph $G$ is a collection of vertex-disjoint copies of the graph $K_r$ in $G$ that covers all vertices of $G$. In this paper, we prove that the threshold for the existence of a perfect $K_{r}$-tiling of a…

We consider harmonic maps from Minkowski space into the three sphere. We are especially interested in solutions which are asymptotically constant, i.e. converge to the same value in all directions of spatial infinity. Physical 3-space can…

This paper concerns the existence of multiple rotating periodic solutions for $2n$ dimensional convex Hamiltonian systems. For the symplectic orthogonal matrix $Q$, the rotating periodic solution has the form of $z(t+T)=Qz(t)$, which might…

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

A thin and narrow rectangular plate having the two short edges hinged and the two long edges free is considered. A nonlinear nonlocal evolution equation describing the deformation of the plate is introduced: well-posedness and existence of…

We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

We study outer length billiards; our main results are as follows. We prove 3- and 4-periodic versions of the Ivrii conjecture. We show that, for every period $n\ge 3$, there exists a functional space of billiard tables that possess…

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…