English
Related papers

Related papers: On the Topological Tverberg Theorem

200 papers

Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles. It is famous as one of the one hundred unsolved problems selected in…

Combinatorics · Mathematics 2018-05-31 Yandong Bai , Yannis Manoussakis

Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…

Combinatorics · Mathematics 2017-07-31 Jan Hladky , Diana Piguet , Miklos Simonovits , Maya Stein , Endre Szemeredi

For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of a transitive tournament. We prove that almost every…

Combinatorics · Mathematics 2026-05-26 Meili Liang , Yue Guan , Ruiling Zheng , Jianxi Liu

A descent conjecture of Wittenberg [Wit24, Conjecture 3.7.4] predicts that if all the twists of a rationally connected torsor over a smooth base satisfy weak approximation with Brauer-Manin obstruction, then so does the base. We give an…

Algebraic Geometry · Mathematics 2026-04-14 Yisheng Tian

A celebrated conjecture of Sidorenko and Erd\H{o}s-Simonovits states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge…

Combinatorics · Mathematics 2021-03-30 David Conlon , Joonkyung Lee

We prove a new theorem of Tverberg type which confirms the conjecture of Blagojevic, Frick, and Ziegler about the existence of "balanced Tverberg partitions" (Conjecture 6.6 in, Tverberg plus constraints, Bull. London Math. Soc., 46 (2014)…

Combinatorics · Mathematics 2016-08-16 Duško Jojić , Siniša Vrećica , Rade Živaljević

Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…

Combinatorics · Mathematics 2023-04-21 Marcin Stawiski

For each integer q>0 there is a cohomology theory such that the zero cohomology group of a manifold N of dimension n is a certain group of cobordism classes of proper fold maps of manifolds of dimension n+q into N. We prove a splitting…

Geometric Topology · Mathematics 2012-03-06 Rustam Sadykov

$\newcommand{\floor}[1]{\left\lfloor {#1} \right\rfloor} \renewcommand{\Re}{\mathbb{R}}$ Tverberg's theorem states that a set of $n$ points in $\Re^d$ can be partitioned into $\floor{n/(d+1)}$ sets with a common intersection. A point in…

Computational Geometry · Computer Science 2023-05-03 Sariel Har-Peled , Timothy Zhou

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…

Combinatorics · Mathematics 2023-04-17 Dane Miyata , Eric Ramos

Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…

Combinatorics · Mathematics 2024-05-28 David Conlon , Joonkyung Lee , Alexander Sidorenko

We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…

Computational Geometry · Computer Science 2017-11-03 David Rolnick , Pablo Soberón

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

Computational Geometry · Computer Science 2020-08-17 Uli Wagner , Emo Welzl

As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, ...,e_{2k}, J\})$ where $e_i$'s are standard basis and $J$ is…

Combinatorics · Mathematics 2015-01-22 Reza Naserasr , Sagnik Sen , Qiang Sun

For a vertex $x$ of a digraph, $d^+(x)$ ($d^-(x)$, resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++}(x)$ is the number of vertices at distance 2 from $x$. In 1995, Seymour conjectured that for any oriented…

Combinatorics · Mathematics 2023-06-07 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Shujing Wang , Anders Yeo , Yacong Zhou

Topological invariants such as winding numbers and linking numbers appear as charges of topological solitons in diverse nonlinear physical systems described by a unit vector field defined on two and three dimensional manifolds. While the…

Pattern Formation and Solitons · Physics 2024-01-23 Radha Balakrishnan , Rossen Dandoloff , Avadh Saxena

The Second Neighborhood Conjecture of Seymour asserts that every oriented graph contains a vertex~$v$ satisfying $|\Npp(v)|\ge|\Np(v)|$. We introduce \emph{Pisa graphs} -- strongly connected oriented graphs~$D$ with $\Delta(D)=\max_{v\in…

Combinatorics · Mathematics 2026-05-25 Stanisław M. S. Halkiewicz

The $3x+1$ Conjecture asserts that the $T$-orbit of every positive integer $x$ contains $1$, where $T$ maps $x$ to $x/2$ for $x$ even and to $(3x+1)/2$ for $x$ odd. Several authors have studied the analogous map, $T_q$, which maps $x\in…

Number Theory · Mathematics 2025-11-19 Kenneth G. Monks

We formulate a very general conjecture relating the analytical invariants of a normal surface singularity to the Seiberg-Witten invariants of its link provided that the link is a rational homology sphere. As supporting evidence, we…

Algebraic Geometry · Mathematics 2014-11-11 Andras Nemethi , Liviu I Nicolaescu

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

Quantum Algebra · Mathematics 2016-08-02 Guus Regts , Alexander Schrijver , Bart Sevenster
‹ Prev 1 3 4 5 6 7 10 Next ›