Related papers: Counting Anosov graphs

It is conjectured that every manifold admitting an Anosov diffeomorphism is, up to homeomorphism, finitely covered by a nilmanifold. Motivated by this conjecture, an important problem is to determine which nilmanifolds admit an Anosov…

Anosov diffeomorphisms on closed Riemannian manifolds are a type of dynamical systems exhibiting uniform hyperbolic behavior. Therefore their properties are intensively studied, including which spaces allow such a diffeomorphism. It is…

Anosov diffeomorphisms are an important class of dynamical systems with many peculiar properties. Ever since they were introduced in the sixties, it has been an open question which manifolds can admit such diffeomorphisms, where tori of…

We give a simple procedure to construct explicit examples of nilmanifolds admitting an Anosov diffeomorphism, and show that a reasonable classification up to homeomorphism (or even up to commensurability) of such nilmanifolds would not be…

This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…

A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$, every edge of $G$ lies in a cycle of length $k$. Determining the minimum size $f(n)$ of a simple edge-pancyclic graph with $n$ vertices…

A few years ago, the first example of a closed manifold admitting an Anosov diffeomorphism but no expanding map was given. Unfortunately, this example is not explicit and is high-dimensional, although its exact dimension is unknown due to…

In the paper we give a lower bound for the number of vertices of a given graph using its chromatic number. We find the graphs for which this bound is exact. The results are applied in the theory of Foklman numbers.

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

We give a necessary and sufficient condition for $k$-step nilmanifolds associated with graphs $(k \geq 3)$ to admit Anosov automorphisms. We also prove nonexistence of Anosov automorphisms on certain classes of 2-step and 3-step…

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…

We study nilmanifolds admitting Anosov automorphisms by applying elementary properties of algebraic units in number fields to the associated Anosov Lie algebras. We identify obstructions to the existence of Anosov Lie algebras. The case of…

Anosov families were introduced by A. Fisher and P. Arnoux motivated by generalizing the notion of Anosov diffeomorphism defined on a compact Riemannian manifold. Roughly, an Anosov family is a two-sided sequence of diffeomorphisms (or…

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…

For each natural number n, we construct an example of a graph manifold supporting at least n different Anosov flows that are not orbit equivalent. Our construction is reminiscent of the Thurston-Handel construction: we cut a geodesic flow…

We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied for several graphs…

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…