Related papers: Tur\'{a}n problems for multilinear maps

A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are the minimum and maximum number of arcs that contain a common…

The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…

We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of $q$-colorings among graphs with $n$ vertices and $m$ edges. Let $T_r(n)$ denote the Tur\'{a}n graph - the complete…

Our studies are directed to the existence of weak solutions to a parabolic problem containing a multi-valued term. The problem is formulated in the language of maximal monotone graphs. We assume that the growth and coercivity conditions of…

Given a graph H and a positive integer n, the planar Turan number of H, denoted by exp(n, H), is the maximum number of edges in an n-vertex H-free planar graph.D.Ghosh, et al.initiated the topic of double stars S_(k,l). Recently Xu et…

We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the unique extremal graph for forests consisting of paths when n is…

The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…

The uniform Tur\'an density $\pi_{u}(F)$ of a $3$-uniform hypergraph (or $3$-graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$-free $3$-graphs $H$ in which every induced subhypergraph on a linearly sized vertex…

We give a solution to the Poincar\'e Problem, in the formulation of Cerveau and Lins Neto. We obtain a bound on the degree of general leaves of foliations of general type, which is linear in $g$. To achieve this we study the birational…

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…

In this paper, we give an improved Morse index bound of minimal hypersurfaces from Almgren-Pitts min-max construction in any closed Riemannian manifold $M^{n+1}$ $(n+1 \geq 3$), which generalizes a result by X. Zhou…

For positive integers $s,t,r$, let $K_{s,t}^{(r)}$ denote the $r$-uniform hypergraph whose vertex set is the union of pairwise disjoint sets $X,Y_1,\dots,Y_t$, where $|X| = s$ and $|Y_1| = \dots = |Y_t| = r-1$, and whose edge set is…

For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…

Let $\mathcal{F}$ be a set of graphs. The planar Tur\'an number, $ex_{\mathcal{P}}(n,\mathcal{F})$, is the maximum number of edges in an $n$-vertex planar graph which does not contain any member of $\mathcal{F}$ as a subgraph. In this…

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

The Tur\'an number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P_l^(r) denote the family of r-uniform loose paths on l edges, F(k,l) denote the family…

The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…