English
Related papers

Related papers: Flip-Flop Sublinear Models for Graphs: Proof of Th…

200 papers

We show there exist no nontrivial semidualizing modules for nonmodular rings of invariants of order $p^n$ with $p$ a prime.

Commutative Algebra · Mathematics 2014-08-26 William Sanders

We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…

Computational Geometry · Computer Science 2026-03-13 Petr Hliněný , Jan Jedelský

We construct explicit minimal models for the (hyper)operads governing modular, cyclic and ordinary operads, and wheeled properads, respectively. Algebras for these models are homotopy versions of the corresponding structures.

Category Theory · Mathematics 2022-12-13 Michael Batanin , Martin Markl , Jovana Obradović

A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…

Combinatorics · Mathematics 2023-11-10 Sahar Diskin , Ilay Hoshen , Michael Krivelevich , Maksim Zhukovskii

Tropical curves in $\mathbb{R}^2$ correspond to metric planar graphs but not all planar graphs arise in this way. We describe several new classes of graphs which cannot occur. For instance, this yields a full combinatorial characterization…

Combinatorics · Mathematics 2021-08-03 Michael Joswig , Ayush Kumar Tewari

In this paper we prove that there does not exist a subgroup $H$ of a finite group $G$ such that the number of isomorphism classes of normalized right transversals of $H$ in $G$ is four.

Group Theory · Mathematics 2012-03-29 Vipul Kakkar , R. P. Shukla

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.

Combinatorics · Mathematics 2011-04-26 Xin Zhang

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Combinatorics · Mathematics 2024-09-12 Radek Hušek , Robert Šámal

We prove, as our main theorem, the finiteness of topological type of a complete open Riemannian manifold $M$ with a base point $p \in M$ whose radial curvature at $p$ is bounded from below by that of a non-compact model surface of…

Differential Geometry · Mathematics 2011-02-07 Kei Kondo , Minoru Tanaka

Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…

Combinatorics · Mathematics 2022-11-22 Vida Dujmović , Pat Morin , David R. Wood

Let $\Sigma$ be a complete Riemannian manifold of nonnegative Ricci curvature. We prove a Liouville-type theorem: every smooth solution $u$ to minimal hypersurface equation on $\Sigma$ is a constant provided $u$ has sublinear growth for its…

Differential Geometry · Mathematics 2025-11-12 Qi Ding

We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum…

Combinatorics · Mathematics 2007-08-30 Teodor Banica , Julien Bichon , Gaetan Chenevier

Let $p$ be a prime integer and $F$ the function field in two algebraically independent variables over a smaller field $F_0$. We prove that if $\operatorname{char}(F_0)=p\geq 3$ then there exist $p^2-1$ cyclic algebras of degree $p$ over $F$…

Rings and Algebras · Mathematics 2021-04-20 Adam Chapman

We show that every thick subcategory of the singularity category of a complete intersection ring is self dual. We also prove the analogous statement for thick subcategories of the bounded derived category and give applications to the…

Commutative Algebra · Mathematics 2017-05-17 Greg Stevenson

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

Logic in Computer Science · Computer Science 2023-06-22 Matteo Acclavio , Ross Horne , Lutz Straßburger

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…

Computational Geometry · Computer Science 2021-05-28 Patrizio Angelini , Michael A. Bekos , Fabrizio Montecchiani , Maximilian Pfister

We prove a no-triplets theorem for spin 1 particles, which implies a strengthened form of the no-cloning theorem.

Quantum Physics · Physics 2007-11-16 John Conway , Simon Kochen

For cardinals lambda, kappa, theta we consider the class of graphs of cardinality lambda which has no subgraph which is (kappa, theta)-complete bipartite graph. The question is whether in such a class there is a universal one under (weak)…

Logic · Mathematics 2010-05-18 Saharon Shelah

The following results are proved: Theorem 1. A totally real semiparallel submanifold of constant curvature with parallel f-structure in the normal bundle of a K\"ahler manifold N is flat or a totally geodesic submanifold of N. Theorem 2. A…

Differential Geometry · Mathematics 2010-10-11 Ognian Kassabov

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

Combinatorics · Mathematics 2007-10-23 Andy Frohmader