Related papers: Transitive oriented 3-Hypergraphs of cyclic orders
Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever $p>p_c$, are a large class of graphs more general than quasi-transitive graphs. Let $G$ be a semi-transitive graph with one end which…
Following the new description of an oriented full transformation on a finite chain given recently by Higgins and Vernitski in "Orientation-preserving and orientation-reversing mappings: a new description", Semigroup Forum 104 (2022),…
We show that the notion of $3$-hyperconvexity on oriented flag manifolds defines a partial cyclic order. Using the notion of interval given by this partial cyclic order, we construct Schottky groups and show that they correspond to images…
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…
We show that certain types of the three-legged accessibility property of a partially hyperbolic diffeomorphism imply the existence of a unique minimal set for one strong foliation and the transitivity of the other one. In case the center…
The orientation completion problem for a class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class by orienting the unoriented edges of the partially oriented graph.…
We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…
We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing…
Recently the classification of all possible faithful transitive permutation representations of the group of symmetries of a regular toroidal map was accomplished. In this paper we complete this investigation on a surface of genus 1…
In this article we give several characterizations for various transitivity properties for linear operators. We define a general form of `Hypercyclicity Criterion' using a Furstenberg family $\mathcal{F}$ to characterize…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited…
Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form an interval hypergraph. We investigate here properties of…
In this paper, we give a characterization for a class of edge-transitive Cayley graphs, and provide methods for constructing Cayley graphs with certain symmetry properties. Also this study leads to construct and characterise a new family of…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
A transitive tournament is an acyclic orientation of a complete graph. We study decompositions and packings of the transitive tournament \(TT_n\) into connected two-arc motifs. The three motifs considered are chains, colliders, and forks,…
A tetravalent $2$-arc-transitive graph of order $728$ is either the known $7$-arc-transitive incidence graph of the classical generalized hexagon $GH(3,3)$ or a normal cover of a $2$-transitive graph of order $182$ denoted $A[182,1]$ or…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection…
We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n)…