相关论文: On a Tur\'an problem in weakly quasirandom 3-unifo…

By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices…

We show that for all $k\geq 4$, $\varepsilon >0$, and $n$ sufficiently large, every $k$-uniform hypergraph on $n$ vertices in which each set of $k-3$ vertices is contained in at least $(5/8 + \varepsilon) \binom{n}{3}$ edges contains a…

An extremal graph for a given graph $H$ is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $s,t$ be integers and let $H_{s,t}$ be a graph consisting of $s$ triangles and $t$ cycles of odd…

The $3$-uniform tight $\ell$-cycle $C_\ell^{3}$ is the $3$-graph on $\{1,\dots,\ell\}$ consisting of all $\ell$ consecutive triples in the cyclic order. Let $\mathcal{C}$ be either the pair $\{C_{4}^{3}, C_{5}^{3}\}$ or the single tight…

Given a graph $G$, a hypergraph $\mathcal{H}$ is a Berge copy of $F$ if $V(G)\subset V(\mathcal{H})$ and there is a bijection $f:E(G)\rightarrow E(\mathcal{H})$ such that for any edge $e$ of $G$ we have $e\subset f(e)$. We study Ramsey…

Let $m:=|E(G)|$ sufficiently large and $s:=(m-1)/3$. We show that unless the maximum degree $\Delta > 2s$, there is a weighting $w:E\cup V\to \{0,1,...,s\}$ so that $w(uv)+w(u)+w(v)\ne w(u'v')+w(u')+w(v')$ whenever $uv\ne u'v'$ (such a…

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the variable is fixed to the value satisfying the equation. The…

Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

Write $K^{(k)}_{n}$ for the complete $k$-graph on $n$ vertices. For $2 \leq k \leq g < r$ integers, let $\pi\left(n, K^{(k)}_{g}, K^{(k)}_r\right)$ be the maximum density of $K^{(k)}_{g}$ in $n$ vertex $K^{(k)}_{r}$-free $k$-graphs. The…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of $K_n$ is bipartite. A sparse version of Mantel's Theorem is that, for sufficiently large $p$, every maximum…

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…

In this work, we estimate the number of hyperedges in a hypergraph ${\cal H}(U({\cal H}), {\cal F}({\cal H}))$, where $U({\cal H})$ denotes the set of vertices and ${\cal F}({\cal H}))$ denotes the set of hyperedges. We assume a query…

An extremal graph for a graph $H$ on $n$ vertices is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $T_{n,r}$ be the Tur\'{a}n graph, which is the complete $r$-partite graph on $n$ vertices…

Zarankiewicz's problem asks for the largest possible number of edges in a graph that does not contain a $K_{u,u}$ subgraph for a fixed positive integer $u$. Recently, Fox, Pach, Sheffer, Sulk and Zahl considered this problem for…

This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which…

Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…