English
Related papers

Related papers: On the support of a non-autocorrelated function on…

200 papers

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…

Combinatorics · Mathematics 2015-04-17 Yair Caro , Josef Lauri , Christina Zarb

Let $\varphi:F_1\to F_2$ be an injective morphism of free groups. If $\varphi$ is geometric (i.e. induced by an inclusion of oriented compact connected surfaces with nonempty boundary), then we show that $\varphi$ is an isometric embedding…

Geometric Topology · Mathematics 2025-01-28 Alexis Marchand

In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…

Combinatorics · Mathematics 2024-11-12 Krystal Guo , Ross J. Kang , Gabriëlle Zwaneveld

Consider a surface $\Sigma$ with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface $\Sigma_n$ by singling out one of the boundary components and denoting by $n$ the…

Geometric Topology · Mathematics 2025-05-08 Pallavi Panda , Hugo Parlier , Lionel Pournin

We study the non-linear supersymmetric hyperbolic sigma model $H^{2|2}$ on a complete graph with hierarchical interactions. For interactions which do not decrease too fast in the hierarchical distance, we prove tightness of certain spin…

Probability · Mathematics 2021-11-17 Margherita Disertori , Franz Merkl , Silke W. W. Rolles

A proper vertex-coloring of a graph is $r$-dynamic if the neighbors of each vertex $v$ receive at least $\min(r, \mathrm{deg}(v))$ different colors. In this note, we prove that if $G$ has a strong $2$-coloring number at most $k$, then $G$…

Combinatorics · Mathematics 2025-01-24 Miriam Goetze , Torsten Ueckerdt

The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $\alpha>2^{-1/3}$ there exists an integer $\Delta_{\alpha}$…

Combinatorics · Mathematics 2022-05-24 Lefteris Kirousis , John Livieratos

The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has been…

Combinatorics · Mathematics 2020-09-29 Pierre Aboulker , Pierre Charbit , Reza Naserasr

We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…

Differential Geometry · Mathematics 2016-07-19 Laurent Mazet , Magdalena Rodriguez , Harold Rosenberg

The $c$-strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least $c$ colours or is rainbow. We show that every $t$-intersecting hypergraph has bounded $(t +…

Combinatorics · Mathematics 2024-06-21 Kevin Hendrey , Freddie Illingworth , Nina Kamčev , Jane Tan

A classical theorem of Micallef says that if $F \colon (\Sigma, g) \to \mathbb{R}^4$ is a stable minimal immersion of an oriented $2$-dimensional complete Riemannian manifold (that is parabolic) into $\mathbb{R}^4$, it is necessarily…

Differential Geometry · Mathematics 2025-09-29 Da Rong Cheng , Spiro Karigiannis , Jesse Madnick

We show that for any surface of genus at least 3 equipped with any choice of framing, the graph of non-separating curves with winding number 0 with respect to the framing is hierarchically hyperbolic but not Gromov hyperbolic. We also…

Geometric Topology · Mathematics 2025-04-22 Aaron Calderon , Jacob Russell

We show that if the curvature of a Cartan-Hadamard $n$-manifold is constant near a convex hypersurface $\Gamma$, then the total Gauss-Kronecker curvature $\mathcal{G}(\Gamma)$ is not less than that of any convex hypersurface nested inside…

Differential Geometry · Mathematics 2026-01-21 Mohammad Ghomi , John Ioannis Stavroulakis

Let $[\gamma]$ be the conformal boundary of a warped product $C^{3,\alpha}$ AHE metric $g=g_M+u^2h$ on $N=M \times F$, where $(F,h)$ is compact with unit volume and nonpositive curvature. We show that if $[\gamma]$ has positive Yamabe…

Differential Geometry · Mathematics 2007-10-16 Mohammad Javaheri

A noncompact (oriented) surface satisfies the condition $(\star)$ if their isolated ends are ''accumulated by genus''. We show that every surface satisfying this condition is homeomorfic to the leaf of a minimal codimension one foliation on…

Geometric Topology · Mathematics 2024-01-04 Paulo Gusmão , Carlos Meniño Cotón

We prove that for some manifolds $M$ the set of robustly transitive partially hyperbolic diffeomorphisms of $M$ with one-dimensional nonhyperbolic centre direction contains a $C^1$-open and dense subset of diffeomorphisms with nonhyperbolic…

Dynamical Systems · Mathematics 2018-10-08 Christian Bonatti , Lorenzo J. Díaz , Dominik Kwietniak

For $r\geq 3$, let $f_r\colon [0,\infty)\to [1,\infty)$ be the unique analytic function such that $f_r({k\choose r})={k-1\choose r-1}$ for any $k\geq r-1$. We prove that the spectral radius of an $r$-uniform hypergraph $H$ with $e$ edges is…

Combinatorics · Mathematics 2017-05-05 Shuliang Bai , Linyuan Lu

Let $G$ be a simple graph on $n$ vertices and $m$ edges with chromatic number $\chi$, and let $\lambda_n$ denote the least adjacency eigenvalue. Solving a conjecture of Fan, Yu and Wang~[Electron. J. Combin., 2012], we prove that when $3\le…

Combinatorics · Mathematics 2026-01-22 Quanyu Tang , Clive Elphick

We show that any measurable solution of the cohomological equation for a H\"older linear cocycle over a hyperbolic system coincides almost everywhere with a H\"older solution. More generally, we show that every measurable invariant…

Dynamical Systems · Mathematics 2018-07-25 Clark Butler

One of the best-known results in spectral graph theory is the inequality of Hoffman \[ \chi\left( G\right) \geq1-\frac{\lambda\left( G\right) }{\lambda_{\min }\left( G\right) }, \] where $\chi\left( G\right) $ is the chromatic number of a…

Combinatorics · Mathematics 2019-08-06 V. Nikiforov