Related papers: Solution of Hypergraph Turan problem

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric…

We apply theta body relaxations to the $K_i$-cover problem and show polynomial time solvability for certain classes of graphs. In particular, we give an effective relaxation where all $K_i$-$p$-hole facets are valid, and study its relation…

We consider the problem of space-efficiently estimating the number of simplices in a hypergraph stream. This is the most natural hypergraph generalization of the highly-studied problem of estimating the number of triangles in a graph…

In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…

We suggest a reduction of the combinatorial problem of hypergraph partitioning to a continuous optimization problem.

We study the problem of deleting a minimum cost set of vertices from a given vertex-weighted graph in such a way that the resulting graph has no induced path on three vertices. This problem is often called cluster vertex deletion in the…

The Willmore flow is well known problem from the differential geometry. It minimizes the Willmore functional defined as integral of the mean-curvature square over given manifold. For the graph formulation, we derive modification of the…

Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…

Mean curvature flow for isoparametric submanifolds in Euclidean spaces and spheres was studied by the authors in [LT]. In this paper, we will show that all these solutions are ancient solutions. We also discuss rigidity of ancient mean…

The Tur\'an number of a graph $H$, denoted by $\text{ex}(n, H)$, is the maximum number of edges in an $n$-vertex graph that does not have $H$ as a subgraph. Let $TP_k$ be the triangular pyramid of $k$-layers. In this paper, we determine…

We develop an algorithm solving the 3x3 real symmetric eigenproblem. This is a common problem and in certain applications it must be solved many thousands of times, see for example \cite{tripref} where each element in a finite element grid…

In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point…

Given positive integers $a\leq b \leq c$, let $K_{a,b,c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a,b,c$. Let $H$ be a 3-uniform hypergraph on $n$ vertices where $n$ is divisible by $a+b+c$. We…

We solve an asymptotic variant of a smooth version of the $A_n$-realization problem for plane curves. As an application, we determine the cobordism distance between torus links of type $T(d,d)$ and $T(2,N)$ up to an error of at most $3d$.…

In this paper, we present the clockwise-algorithm that solves the extension in $k$-dimensions of the infamous nine-dot problem, the well-known two-dimensional thinking outside the box puzzle. We describe a general strategy that…

We study the Tur\'{a}n numbers of $3$-graphs avoiding $3$-graphs $F$ and $M_{s+1}^3$, a matching of size $s+1$. We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journal of Combinatorics, 2025, 127:104155] on…

Alon, Balogh, Keevash and Sudakov proved that the $(k-1)$-partite Tur\'an graph maximizes the number of distinct $r$-edge-colorings with no monochromatic $K_k$ for all fixed $k$ and $r=2,3$, among all $n$-vertex graphs. In this paper, we…

We introduce a modification of the Tur\'an density of ordered graphs and investigate this graph parameter.

We study Galois embedding problems arising from the 3-torsion of elliptic curves defined over $\mathbb{Q}$, extending the correspondence to all possible images of mod 3 Galois representations; namely,…

We use a new method to give conditions for the existence of a local isometric immersion of a Riemannian $n$-manifold $M$ in $\mathbb{R}^{n+k}$, for a given $n$ and $k$. These equate to the (local) existence of a $k$-tuple of scalar fields…