English
Related papers

Related papers: Borel Edge Colorings for Finite Dimensional Groups

200 papers

We study the (Ahlfors regular) conformal dimension of the boundary at infinity of Gromov hyperbolic groups which split over elementary subgroups. If such a group is not virtually free, we show that the conformal dimension is equal to the…

Metric Geometry · Mathematics 2022-08-23 Matias Carrasco , John M. Mackay

Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.

Combinatorics · Mathematics 2007-05-23 Béla Bollobás , Douglas B. West

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Combinatorics · Mathematics 2012-04-06 Eric Babson , Matthias Beck

We obtain asymptotic estimates for the $\ell^p$-operator norm of spherical averaging operators associated to certain geometric group actions. The motivating example is the case of Gromov hyperbolic groups, for which we obtain asymptotically…

Group Theory · Mathematics 2024-05-15 Bogdan Nica

The analytic and formal solutions to a family of singularly perturbed partial differential equations in the complex domain involving two complex time variables are considered. The analytic continuation properties of the solution of an…

Complex Variables · Mathematics 2025-06-03 Guoting Chen , Alberto Lastra , Stephane Malek

We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t$, a {\em threshold-coloring} of the graph is an assignment…

Data Structures and Algorithms · Computer Science 2014-03-07 Md. Jawaherul Alam , Stephen G. Kobourov , Sergey Pupyrev , Jakson Toeniskoetter

In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…

Combinatorics · Mathematics 2021-07-01 Emanuel Florentin Olariu , Cristian Frasinaru

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is…

Combinatorics · Mathematics 2010-10-19 Frantisek Kardos , Daniel Kral , Jan Volec

We prove that for any generating set $S$ of $\mathbb {Z}^n$, the continuous edge chromatic number of the Schreier graph of the Bernoulli shift action $G=F(S,2^{\mathbb{Z}^n})$ is $\chi'_c(G)=\chi'(G)+1$. In particular, for the standard…

Combinatorics · Mathematics 2024-09-27 Su Gao , Ruijun Wang , Tianhao Wang

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…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

Let $\mathbb{K}$ be a field and $R = \mathbb{K}[x_1, \ldots, x_n]$. We obtain an improved upper bound for asymptotic resurgence of squarefree monomial ideals in $R$. We study the effect on the resurgence when sum, product and intersection…

Commutative Algebra · Mathematics 2022-09-12 A. V. Jayanthan , Arvind Kumar , Vivek Mukundan

We introduce the notion of asymptotic Grothendieck groups for abelian and triangulated categories that are both AB4 and AB4*. We study when the asymptotic Grothendieck group of the heart of a triangulated category with a t-structure is…

Category Theory · Mathematics 2021-08-20 Gregoire Naisse

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…

Logic · Mathematics 2023-04-06 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward

Proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring.…

Combinatorics · Mathematics 2012-03-26 Yue Guan , Jianfeng Hou , Yingyuan Yang

We develop tools to study arithmetically induced singular continuous spectrum in the neighborhood of the arithmetic transition in the hyperbolic regime. This leads to first transition-capturing upper bounds on packing and multifractal…

Spectral Theory · Mathematics 2025-01-22 Svetlana Jitomirskaya , Wencai Liu , Serguei Tcheremchantsev

We study the asymptotic growth of the number of rational points of bounded height on smooth projective split toric varieties with Picard rank 2 over number fields, with respect to Arakelov height functions associated with big metrized line…

Number Theory · Mathematics 2024-07-30 Sebastián Herrero , Tobías Martínez , Pedro Montero

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

Classical Analysis and ODEs · Mathematics 2021-02-02 Petr Blaschke , František Štampach

We prove a Hurewicz-type theorem for the dynamic asymptotic dimension originally introduced by Guentner, Willett, and Yu. Calculations of (or simply upper bounds on) this dimension are known to have implications related to cohomology of…

Group Theory · Mathematics 2025-10-29 Samantha Pilgrim

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

Combinatorics · Mathematics 2025-12-23 David Bevan , Julien Condé

In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…

Discrete Mathematics · Computer Science 2013-05-20 Md. Jawaherul Alam , Steven Chaplick , Gašper Fijavž , Michael Kaufmann , Stephen G. Kobourov , Sergey Pupyrev
‹ Prev 1 8 9 10 Next ›