Related papers: Link projections and flypes

The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Bar\'at and Thomassen: for each tree $T$, there exists a natural number $k_T$ such that if $G$ is a…

We give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs [T. Kaiser and P. Vr\'ana, Hamilton cycles in 5-connected line graphs, European J. Combin. 33 (2012), 924-947]. It…

The convergence theory for the set of simultaneously $\psi$-approximable points lying on a planar curve is established. Our results complement the divergence theory developed in `Diophantine approximation on planar curves and the…

The classical trace map is a highly non-trivial map from algebraic K-theory to topological Hochschild homology (or topological cyclic homology) introduced by B\"okstedt, Hsiang and Madsen. It led to many computations of algebraic K-theory…

For any positive integer $n$, Lov\'{a}sz-Schrijver, Taniyama and Skopenkov provided examples of simplicial $n$-complexes that inevitably contain a nonsplittable two-component link of $n$-spheres, no matter how they are embedded into the…

We introduce the notion of a chopped and sliced cone in combinatorial geometry and prove two structure theorems for the number of integral points in the individual slices of such a cone. We observe that this notion applies to weight…

A compact classification of the projective lines defined over (commutative) rings (with unity) of all orders up to thirty-one is given. There are altogether sixty-five different types of them. For each type we introduce the total number of…

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Inspired by the recent work of Nima Arkani Hamed and collaborators who introduced the notion of positive geometry to account for the structure of tree-level scattering amplitudes in bi-adjoint $\phi^3$ theory, which led to one-loop…

We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity is defined in terms of joining virtual link diagrams, which…

We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

We study {\em generalized graph splines,} introduced by Gilbert, Viel, and the last author. For a large class of rings, we characterize the graphs that only admit constant splines. To do this, we prove that if a graph has a particular type…

In a recent work, N. Hindman, D. Strauss and L. Zamboni have shown that the Hales-Jewett theorem can be combined with a sufficiently well behaved homomorphisms. Their work was completely algebraic in nature, where they have used the algebra…

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…

This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…