English
Related papers

Related papers: On a Koolen -- Park inequality and Terwilliger gra…

200 papers

Let $f:S^2\to S^2$ be an orientation-preserving branched covering map of degree $d\geq 2$, and let $\Sigma$ be an oriented Jordan curve passing through the critical values of $f$. Then $\Gamma:=f^{-1}(\Sigma)$ is an oriented graph on the…

Geometric Topology · Mathematics 2015-02-18 Sarah Koch , Tan Lei

K\"uhn, Osthus and Taraz showed that for each \gamma>0 there exists C such that any n-vertex graph with minimum degree \gamma n contains a planar subgraph with at least 2n-C edges. We find the optimum value of C for all \gamma<1/2 and…

Combinatorics · Mathematics 2013-01-09 Peter Allen , Jozef Skokan , Andreas Würfl

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Combinatorics · Mathematics 2009-02-10 László Lovász , Balázs Szegedy

We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delta) \cdot n$ for some constant $c_k > 0$,…

Combinatorics · Mathematics 2026-03-27 Chunchao Fan , Qizhong Lin

We prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+1)$-connected induced subgraph $H$ such that the number of vertices of $H$ that have neighbors outside of $H$ is at most $2k^2-1$. This generalizes a classical…

Combinatorics · Mathematics 2016-11-04 Irena Penev , Stéphan Thomassé , Nicolas Trotignon

Let $\Sigma$ be a smooth Riemannian manifold, $\Gamma \subset \Sigma$ a smooth closed oriented submanifold of codimension higher than $2$ and $T$ an integral area-minimizing current in $\Sigma$ which bounds $\Gamma$. We prove that the set…

Analysis of PDEs · Mathematics 2021-07-07 Camillo De Lellis , Guido De Philippis , Jonas Hirsch , Annalisa Massaccesi

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

Combinatorics · Mathematics 2023-06-19 Theo McKenzie , Peter M. R. Rasmussen , Nikhil Srivastava

Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…

Commutative Algebra · Mathematics 2012-03-12 Stefan O. Tohaneanu

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

In 2020, Siemons and Zalesski [On the second eigenvalue of some Cayley graphs of the symmetric group. {\it arXiv preprint arXiv:2012.12460}, 2020] determined the second eigenvalue of the Cayley graph $\Gamma_{n,k} =…

Combinatorics · Mathematics 2021-09-01 Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

In the year 2000, Eric Egge introduced the generalized Terwilliger algebra $\mathcal T$ of a distance-regular graph $\Gamma$. For any vertex $x$ of $\Gamma,$ there is a surjective algebra homomorphism $\natural$ from $\mathcal T$ to the…

Combinatorics · Mathematics 2023-02-17 Nathan Nicholson

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

Combinatorics · Mathematics 2025-03-05 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

Combinatorics · Mathematics 2026-02-04 Viresh Patel , Mehmet Akif Yıldız

We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $\ell$-walk-regular with $\ell >1$ if the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two…

Combinatorics · Mathematics 2017-09-13 Edwin R. van Dam , Gholamreza Omidi

Consider a connected homogeneous Riemannian manifold $(M,ds^2)$ and a Riemannian covering $(M,ds^2) \to \Gamma \backslash (M,ds^2)$. If $\Gamma \backslash (M,ds^2)$ is homogeneous then every $\gamma \in \Gamma$ is an isometry of constant…

Differential Geometry · Mathematics 2023-03-30 Joseph A. Wolf

\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…

Combinatorics · Mathematics 2024-02-08 Saeed Shaebani

For a graph $\Gamma$, the {\em distance} $d_\Gamma(u,v)$ between two distinct vertices $u$ and $v$ in $\Gamma$ is defined as the length of the shortest path from $u$ to $v$, and the {\em diameter} $\mathrm{diam}(\Gamma)$ of $\Gamma$ is the…

Combinatorics · Mathematics 2025-06-06 Jun-Jie Huang

Let $R$ be a commutative ring with unity. The co-maximal ideal graph of $R$, denoted by $\Gamma(R)$, is a graph whose vertices are the proper ideals of $R$ which are not contained in the Jacobson radical of $R$, and two vertices $I_1$ and…

Commutative Algebra · Mathematics 2015-10-28 Saieed Akbari , Babak Miraftab , Reza Nikandish

We give a geometric perspective on the algebra of Drinfeld modular forms for congruence subgroups $\Gamma\leq \GL_2(\bbF_q[T]).$ In particular, we describe an isomorphism between the section ring of a line bundle on the stacky modular curve…

Number Theory · Mathematics 2024-10-15 Jesse Franklin

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

Computational Geometry · Computer Science 2018-09-24 Emilio Di Giacomo , Peter Eades , Giuseppe Liotta , Henk Meijer , Fabrizio Montecchiani
‹ Prev 1 3 4 5 6 7 10 Next ›