Related papers: Maximum Number of Quads

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for…

The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

In this paper, we bound the number of edges of a maximal permutation graph with n vertices. We propose a new method to compute the lower bound by splitting the set of labellings of the edges into six parts, considering one separate problem…

We show that a graph with $n$ vertices and vertex cover of size $k$ has at most $4^k + n$ potential maximal cliques. We also show that for each positive integer $k$, there exists a graph with vertex cover of size $k$, $O(k^2)$ vertices, and…

For a given odd integer $n>1$, we provide some families of imaginary quadratic number fields of the form $\mathbb{Q}(\sqrt{x^2-t^n})$ whose ideal class group has a subgroup isomorphic to $\mathbb{Z}/n\mathbb{Z}$.

Answering a question of Erd\H{o}s and Ne\v{s}et\v{r}il, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.8899^n$ for large enough $n$.

The combinatorics of squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares, and order-preserving squares. The word $uv$ is an Abelian (parameterized,…

Let $n>1$ be an odd integer. We prove that there are infinitely many imaginary quadratic fields of the form $\mathbb{Q}(\sqrt{x^2-2y^n})$ whose ideal class group has an element of order $n$. This family gives a counter example to a…

We study, for the first time, the maximum modulus set of a quasiregular map. It is easy to see that these sets are necessarily closed, and contain at least one point of each modulus. Blumenthal showed that for entire maps these sets are…

Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the…

Applying the Picard-Fuchs equation to the discontinuous differential system, we obtain the upper bounds of the number of zeros for Abelian integrals of four kinds of quadratic differential systems when it is perturbed inside all…

Consider n cards that are labeled 1 through n with n an even integer. The cards are put face down and their ordering starts with card labeled 1 on top through card labeled n at the bottom. The cards are top to random shuffled m times and…

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of…

Let $\mathcal{C}_k(n)$ be the family of all connected $k$-chromatic graphs of order $n$. Given a natural number $x\geq k$, we consider the problem of finding the maximum number of $x$-colorings among graphs in $\mathcal{C}_k(n)$. When…

In this paper we obtain a complete list of imaginary $n$-quadratic fields with class groups of exponent $3$ and $5$ under ERH for every positive integer $n$ where an $n$-quadratic field is a number field of degree $2^n$ represented as the…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.

We study the fully entangled fraction of quantum states. An upper bound is obtained for arbitrary dimensional bipartite systems. This bound is shown to be exact for the case of two-qubit systems. An inequality related the fully entangled…

Let $G$ be a non-bipartite graph which does not contain any odd cycle of length at most $2k+1$. In this paper, we determine the maximum $Q$-index of $G$ if its order is fixed, and the corresponding extremal graph is uniquely characterized.…