Related papers: Higher diameters of Cayley digraphs
We improve some known estimates for the density of the Cayley graph of Thompson's group F in standard generators.
Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic…
We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…
A conjecture regarding the structure of expander graphs is discussed.
All deformations of two dimensional centrally extended Galilei group are classified. The corresponding quantum Lie algebras are found.
We define and study a higher-dimensional version of model theoretic internality, and relate it to higher-dimensional definable groupoids in the base theory.
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
A digraph X=(V, E) is max-\lambda, if \lambda(X)=\delta(X). A digraph X is super-\lambda if every minimum cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that for all…
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…
A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…
This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…
This survey is an invitation to recent developments in higher dimensional birational geometry.
The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.
The $(n,k)$-star graphs are an important class of interconnection networks that generalize star graphs, which are superior to hypercubes. In this paper, we continue the work begun by Cheng et al.~(Graphs and Combinatorics 2017) and complete…
Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.
We study differential geometric properties of cuspidal edges with boundary. There are several differential geometric invariants which are related with the behavior of the boundary in addition to usual differential geometric invariants of…
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…
We examine $q-$series related to higher forms. These forms are cubics, quartics, etc. In some points, in the article we add parts from previous works, in such a way, the article be more complete and readable.
In this paper we introduce Yoke graphs, a family of flip graphs that generalizes several previously studied families of graphs: colored triangle free triangulations, arc permutations and caterpillars. Our main result is the computation of…
After a brief discussion of the history of the problem, we propose a generalization of the map colouring problem to higher dimensions.