English
Related papers

Related papers: Abelian Cayley digraphs with asymptotically large …

200 papers

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

Combinatorics · Mathematics 2019-09-17 Michael D. Barrus

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

Combinatorics · Mathematics 2022-02-01 Nina Kamčev , Anita Liebenau , Nick Wormald

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Combinatorics · Mathematics 2025-10-23 Sandra Albrechtsen , Matthias Hamann

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

Combinatorics · Mathematics 2025-08-27 Mikhail Isaev , Brendan D. McKay

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Combinatorics · Mathematics 2008-06-11 Vladimir Retakh , Robert Lee Wilson

C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…

Combinatorics · Mathematics 2018-01-17 S. Kh. Darbinyan

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…

Combinatorics · Mathematics 2020-07-27 David Conlon , Jonathan Tidor , Yufei Zhao

We construct two families of strongly regular Cayley graphs, or equivalently, partial difference sets, based on elementary abelian groups. The parameters of these two families are generalizations of the Denniston and the dual Denniston…

Combinatorics · Mathematics 2026-02-13 Shuxing Li , James A. Davis , Sophie Huczynska , Laura Johnson , John Polhill

A well-known conjecture asserts that the mapping class group of a surface (possibly with punctures/boundary) does not virtually surject onto $\Z$ if the genus of the surface is large. We prove that if this conjecture holds for some genus,…

Geometric Topology · Mathematics 2014-02-26 Andrew Putman , Ben Wieland

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

Combinatorics · Mathematics 2022-05-18 Catherine Greenhill , Mikhail Isaev , Tamás Makai , Brendan D. McKay

Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which…

Combinatorics · Mathematics 2020-06-01 Koji Momihara

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…

Algebraic Topology · Mathematics 2024-04-02 Shaobo Di , Sergei O. Ivanov , Lev Mukoseev , Mengmeng Zhang

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…

Combinatorics · Mathematics 2020-12-08 Marthe Bonamy , Nicolas Bousquet , Louis Esperet , Carla Groenland , François Pirot , Alex Scott

We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…

Combinatorics · Mathematics 2008-10-07 Tuerker Biyikoglu , Josef Leydold

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

Combinatorics · Mathematics 2026-01-19 Boštjan Kuzman , Primož Šparl

We force a classification of all the Abelian groups of cardinality at most $2^\mathfrak c$ that admit a countably compact group with a non-trivial convergent sequence. In particular, we answer (consistently) Question 24 of Dikranjan and…

General Topology · Mathematics 2020-06-24 Matheus Koveroff Bellini , Vinicius de Oliveira Rodrigues , Artur Hideyuki Tomita

In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…

Mathematical Physics · Physics 2020-06-16 R. Costa de Almeida , J. P. Ibieta-Jimenez , J. Lorca Espiro , P. Teotonio-Sobrinho

In this article we construct for each integer $n\ge 2$ an abelian variety $A$ of dimension $n$ defined over a number field for which there exists a symmetric slope sequence of length $2n$ that does not appear as the slope sequence of…

Number Theory · Mathematics 2014-02-26 Jiangwei Xue , Chia-Fu Yu

It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…

Combinatorics · Mathematics 2019-02-28 Michael Haythorpe