Related papers: Cone avoiding closed sets
An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every edge $e$ contains a vertex $v$ that does not belong to any preceding edge and the set $e-v$ lies in some preceding edge. A conjecture of Kalai [Kalai],…
In this note we prove several theorems that are related to some results and problems from [6]. We answer two of the main problems that were raised in [6]. First we give a ZFC example of a Hausdorff space in $C(\omega_1)$ that has…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+t$, where $t=$max$\{|X|,|Y|\}$, contains a tree $T'\cong T$ such that $G-V(T')$…
Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with…
Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…
We show for each positive integer $a$ that, if $\mathcal{M}$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $c$ such that either every rank-$r$ matroid in $\mathcal{M}$ can…
We study closed subgroups $G$ of the automorphism group of a locally finite tree $T$ acting doubly transitively on the boundary. We show that if the stabiliser of some end is metabelian, then there is a local field $k$ such that…
In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…
This paper is concerned with certain generalizations of meagreness and their combinatorial equivalents. The simplest example, and the one which motivated further study in this area, comes about by considering the following definition: a set…
We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich,…
Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find a coarse analogue of Menger's theorem, which characterizes…
We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.
A subgroup $H$ of a group $G$ is confined if the $G$-orbit of $H$ under conjugation is bounded away from the trivial subgroup in the space $\operatorname{Sub}(G)$ of subgroups of $G$. We prove a commutator lemma for confined subgroups. For…
Strengthening the classical concept of Steiner trees, West and Wu [J. Combin. Theory Ser. B 102 (2012), 186--205] introduced the notion of a $T$-connector in a graph $G$ with a set $T$ of terminals. They conjectured that if the set $T$ is…
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…