Related papers: Happy endings for flip graphs
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
If one erects regular hexagons upon the sides of a triangle $T$, several surprising properties emerge, including: (i) the triangles which flank said hexagons have an isodynamic point common with $T$, (ii) the construction can be extended…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.
We show that 3-fold terminal flips and divisorial contractions may be factored into a sequence of flops, blow-downs to a smooth curve in a smooth 3-fold or divisorial contractions to points with minimal discrepancies.
We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
The \emph{Delaunay graph} of a point set $P \subseteq \mathbb{R}^2$ is the plane graph with the vertex-set $P$ and the edge-set that contains $\{p,p'\}$ if there exists a disc whose intersection with $P$ is exactly $\{p,p'\}$. Accordingly,…
Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…
We characterise $t$-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is $h$-perfect if and only if it is perfect.
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
Felsner introduced a cycle reversal, namely the `flip' reversal, for \alpha-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and further proved that the set of all the \alpha-orientations of…
Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…