English
Related papers

Related papers: Tverberg's theorem with constraints

200 papers

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

Combinatorics · Mathematics 2016-10-14 Annie Raymond

For an upper semi-continuous set-valued mapping from one topological space to another and for a lower semi-continuous function defined on the product of these spaces, Berge's theorem states lower semi-continuity of the minimum of this…

General Topology · Mathematics 2012-03-08 Eugene A. Feinberg , Pavlo O. Kasyanov , Nina V. Zadoianchuk

We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…

Combinatorics · Mathematics 2019-10-07 Ligang Jin , Eckhard Steffen

A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…

Combinatorics · Mathematics 2018-05-22 Johannes Carmesin , Florian Lehner , Rögnvaldur G. Möller

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

We give a complete combinatorial characterization of weakly $d$-Tverberg complexes. These complexes record which intersection combinatorics of convex hulls necessarily arise in any sufficiently large general position point set in $\mathbb…

Combinatorics · Mathematics 2023-10-18 Florian Frick , R. Amzi Jeffs

Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…

Combinatorics · Mathematics 2020-07-10 John C. Urschel , Ludmil T. Zikatanov

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

Logic · Mathematics 2025-07-14 Jana Maříková

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

Differential Geometry · Mathematics 2009-12-15 Ricardo Sá Earp , Eric Toubiana

The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…

Mathematical Physics · Physics 2017-11-16 Pavel Exner , Ondřej Turek

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a…

Logic · Mathematics 2012-12-04 Manuel Bodirsky , Michael Pinsker

We prove (and improve) the Muir-Suffridge conjecture for holomorphic convex maps. Namely, let $F:\mathbb B^n\to \mathbb C^n$ be a univalent map from the unit ball whose image $D$ is convex. Let $\mathcal S\subset \partial \mathbb B^n$ be…

Complex Variables · Mathematics 2017-08-15 Filippo Bracci , Hervé Gaussier

For a disk $D$ in the plane $\mathbb R^2$ and a plane map $f$, we give several conditions on the restriction of $f$ to the boundary $\partial D$ of $D$ which imply the existence of a fixed point of $f$ in some specified domain in $D$. These…

Dynamical Systems · Mathematics 2024-02-27 Jiehua Mai , Enhui Shi , Kesong Yan , Fanping Zeng

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version…

Geometric Topology · Mathematics 2007-05-23 J. Sawollek

A graph $A$ is "apex" if $A-z$ is planar for some vertex $z\in V(A)$. Eppstein [Algorithmica, 2000] showed that for a minor-closed class $\mathcal{G}$, the graphs in $\mathcal{G}$ with bounded radius have bounded treewidth if and only if…

Combinatorics · Mathematics 2025-03-07 Kevin Hendrey , David R. Wood

A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show…

Combinatorics · Mathematics 2015-12-31 Ron Aharoni , János Barát , Ian M. Wanless

We prove a $p$-converse theorem for elliptic curves $E/\mathbb{Q}$ with complex multiplication by the ring of integers $\mathcal{O}_K$ of an imaginary quadratic field $K$ in which $p$ is ramified. Namely, letting $r_p =…

Number Theory · Mathematics 2022-10-21 Daniel Kriz

Let $X$ be a paracompact space, let $G$ be a finite group acting freely on $X$ and let $H$ a cyclic subgroup of $G$ of prime order $p$. Let $f:X\rightarrow M$ be a continuous map where $M$ is a connected $m$-manifold (orientable if $p>2$)…

Algebraic Topology · Mathematics 2016-11-01 Denise de Mattos , Edivaldo L. dos Santos , Taciana O. Souza

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