Related papers: Localized versions of extremal problems

Let $\mathcal{H}$ be a family of graphs. The generalized Tur\'an number $ex(n, K_r, \mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\mathcal{H}$-free graph. In this paper, we determine the value of…

In this note we produce generalized versions of the classical inequalities of Hardy and of Hilbert and we establish their equivalence. Our methods rely on the H^1-BMOA duality. We produce a class of examples to establish that the…

For integers $k, \ell \geq 3$, let $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of…

We study the following generalization of the Tur\'an problem in sparse random graphs. Given graphs $T$ and $H$, let $\mathrm{ex}\big(G(n,p), T, H\big)$ be the random variable that counts the largest number of copies of $T$ in a subgraph of…

The conventional definition of extremality of a finite collection of sets is extended by replacing a fixed point (extremal point) in the intersection of the sets by a collection of sequences of points in the individual sets with the…

In this short note we show that both generalizations of celebrated Erd\H{o}s--Ko--Rado theorem and Hilton--Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from the folklore puzzle about…

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…

In 1988, Erd\H{o}s suggested the question of minimizing the number of edges in a connected $n$-vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In…

We consider local-global principles for torsors under linear algebraic groups, over function fields of curves over complete discretely valued fields. The obstruction to such a principle is a version of the Tate-Shafarevich group; and for…

We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been…

The classical Erd{\" o}s-Turan Inequality bounds how far a sequence of points in the circle is from being equidistributed in terms of its exponential moments. We prove an analogous inequality for all compact simply-connected semisimple Lie…

We prove a generalization of van der Corput's difference theorem for sequences of vectors in a Hilbert space. This generalization is obtained by establishing a connection between sequences of vectors in the first Hilbert space with a vector…

For an integer $r \ge 3$ and a subset $L \subset [0,r-1]$, a graph $G$ is $(K_{r}, L)$-intersecting if the number of vertices in the intersection of every pair of $K_r$ in $G$ belongs to $L$. We study the maximum number of $K_r$ in an…

Generalisations of the virial theorm in Classical Mechanics and Quantum Mechanics are examined. It is shown that the generalised virial theorem in Quantum Mechanics leads to certain relations between matrix elements. The differences between…

Using well-known methods we generalize (hyper)virial theorems to case of singular potential. Discussion is performed for most general second order differential equation, which involves all physically interesting cases, as Schrodinger and…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

We generalise the Erdos-Renyi limit theorem on the maximum of the partial sums of random variables to the case when the number of terms in these sums is randomly distributed. Certain relations between the limiting theorems of this type and…

For fixed graphs $H$ and $F$, the \emph{generalized Tur\'an number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose…

We extend to incremental thermoelectroelasticity with biasing fields certain classical theorems, that have been stated and proved in linear thermopiezoelectricity referred to a natural configuration. A uniqueness theorem for the solutions…

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…