Related papers: The Six-Point Circle Theorem

Let \Delta be a (d-1)-dimensional homology sphere on n vertices with m minimal non-faces. We consider the invariant \alpha := m - (n-d) and prove that for a given value of \alpha, there are only finitely many homology spheres that cannot be…

May the $\mathit{triforce}$ be the 3-uniform hypergraph on six vertices with edges $\{123',12'3,1'23\}$. We show that the minimum triforce density in a 3-uniform hypergraph of edge density $\delta$ is $\delta^{4-o(1)}$ but not…

Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of…

Dean conjectured that for each integer $k \ge 3$, every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$; this conjecture is known to be true for all $k\neq 5$. For $k\in\{3,4\}$, stronger statements are…

Plateau's problem is not a single conjecture or theorem, but rather an abstract framework, encompassing a number of different problems in several related areas of mathematics. In its most general form, Plateau's problem is to find an…

Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…

The model of a scalar field with quartic self-interaction on the fuzzy sphere has three known phases: a uniformly ordered phase, a disordered phase and a non-uniformly ordered phase, the last of which has no classical counterpart. These…

In this paper, we establish an improved version of a saddle point theorem ([4]) removing a weak lower semicontinuity assumption at all. We then revisit some of the applications of that theorem in the light of such an improvement. For…

The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

Let $G$ be a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$. It is proved that if $\delta\ge(n-2)/3$ then each longest cycle in $G$ is a dominating cycle.

We consider the functional $$I_\Omega(v) = \int_\Omega [f(|Dv|) - v] dx,$$ where $\Omega$ is a bounded domain and $f$ is a convex function. Under general assumptions on $f$, G. Crasta [Cr1] has shown that if $I_\Omega$ admits a minimizer in…

Let $n\geq 3$ and let $\Omega \subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in…

We prove that every $3$-graph $H$ on $n$ vertices with minimum codegree $\delta_2(H) \geq 7n/9 + o(n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Bedenknecht and Reiher that $\delta_2(H) \geq 4n/5 + o(n)$…

If $\alpha\in\r$, an $\alpha$-stationary surface in Euclidean space is a surface $\Sigma$ whose mean curvature $H$ satisfies $H(p)=\alpha |p|^{-2} \langle\nu,p\rangle$, $p\in\Sigma$. These surfaces generalize in dimension two a classical…

Let $\pi: X \to Y$ be a morphism of projective varieties and suppose that $\alpha$ is a pseudo-effective numerical cycle class satisfying $\pi_*\alpha = 0$. A conjecture of Debarre, Jiang, and Voisin predicts that $\alpha$ is a limit of…

The bipartite independence number of a graph $G$, denoted as $\tilde\alpha(G)$, is the minimal number $k$ such that there exist positive integers $a$ and $b$ with $a+b=k+1$ with the property that for any two sets $A,B\subseteq V(G)$ with…

Settling a first case of a conjecture of M. Kahle on the homology of the clique complex of the random graph $G=G_{n,p}$, we show, roughly speaking, that (with high probability) the triangles of $G$ span its cycle space whenever each of its…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…