中文
相关论文

相关论文: Shellability of 3-cut complexes of powers of cycle…

200 篇论文

A manifold which admits a reducible genus-$2$ Heegaard splitting is one of the $3$-sphere, $S^2 \times S^1$, lens spaces or their connected sums. For each of those splittings, the complex of Haken spheres is defined. When the manifold is…

几何拓扑 · 数学 2015-12-22 Sangbum Cho , Yuya Koda

A cut in a digraph $D=(V,A)$ is a set of arcs $\{uv \in A: u\in U, v\notin U\}$, for some $U\subseteq V$. It is known that the arc set $A$ is covered by $k$ cuts if and only if it admits a $k$-coloring such that no two consecutive arcs $uv,…

组合数学 · 数学 2024-10-10 Maximilian Krone

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…

组合数学 · 数学 2014-02-07 Peter Allen , Julia Böttcher , Hiep Hàn , Yury Person , Yoshiharu Kohayakawa

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

组合数学 · 数学 2022-07-08 Wiebke Bedenknecht , Christian Reiher

We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…

组合数学 · 数学 2021-02-02 Kasper S. Lyngsie , Martin Merker

For a connected $n$-vertex graph $G$ and a set $\mathcal{F}$ of graphs, let $\iota(G,\mathcal{F})$ denote the size of a smallest set $D$ of vertices of $G$ such that the graph obtained from $G$ by deleting the closed neighbourhood of $D$…

组合数学 · 数学 2021-10-11 Peter Borg

Even the most superficial glance at the vast majority of crossing-minimal geometric drawings of $K_n$ reveals two hard-to-miss features. First, all such drawings appear to be 3-fold symmetric (or simply {\em 3-symmetric}) . And second, they…

组合数学 · 数学 2008-05-08 B. Ábrego , M. Cetina , S. Fernández--Merchant , J. Leaños , G. Salazar

We introduce a type of surgery decomposition of Weinstein manifolds we call simplicial decompositions. The main result of this paper is that the Chekanov-Eliashberg dg-algebra of the attaching spheres of a Weinstein manifold satisfies a…

辛几何 · 数学 2023-04-18 Johan Asplund

Let \pi(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set \pi(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a…

Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…

组合数学 · 数学 2013-02-19 Eric Babson

Let $G$ be a simple and finite graph. A graph is said to be \textit{decomposed} into subgraphs $H_1$ and $H_2$ which is denoted by $G= H_1 \oplus H_2$, if $G$ is the edge disjoint union of $H_1$ and $H_2$. If $G= H_1 \oplus H_2 \oplus H_3…

组合数学 · 数学 2019-08-02 Opeyemi Oyewumi , Abolape D. Akwu

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

组合数学 · 数学 2026-02-11 Rakesh Ghosh , S Selvaraja

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

计算几何 · 计算机科学 2016-06-09 Boris Aronov , Micha Sharir

An old conjecture of Erd{\H{o}}s and Gallai states that every $n$ vertex graph can be decomposed, that is $E(G)$ can be partitioned, into $O(n)$ cycles and edges. The covering version of this conjecture was proven by Pyber in 1985, where it…

组合数学 · 数学 2025-09-09 Saieed Akbari , Jonny Aloni , Arash Beikmohammadi , Alexander Clow

A simple graph $G$ is \textit{k-ordered} (respectively, \textit{k-ordered hamiltonian}), if for any sequence of $k$ distinct vertices $v_1, ..., v_k$ of $G$ there exists a cycle (respectively, hamiltonian cycle) in $G$ containing these $k$…

组合数学 · 数学 2007-05-23 Karola Meszaros

The trace of $n$-framed surgery on a knot in $S^3$ is a 4-manifold homotopy equivalent to the 2-sphere. We characterise when a generator of the second homotopy group of such a manifold can be realised by a locally flat embedded 2-sphere…

For the genus-$4$ Heegaard surface in the $3$-sphere, we present a sufficient condition for a non-separating weak reducing pair to be separated by a reducing sphere for the surface. As a consequence, we reduce the connectivity problem in…

几何拓扑 · 数学 2026-04-20 Sangbum Cho , Yuya Koda , Jung Hoon Lee

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

组合数学 · 数学 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

组合数学 · 数学 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is…

群论 · 数学 2020-09-04 Benjamin Brück , Radhika Gupta
‹ 上一页 1 8 9 10 下一页 ›