相关论文: On Kruskal's theorem that every 3 x 3 x 3 array ha…

We study Gorenstein almost Fano threefolds X with canonical singularities and pseudoindex > 1. We show that the maximal Picard number of X is 10 in general, 3 if X is Fano, and 8 if X is toric. Moreover, we characterize the boundary cases.…

Let X be a complete intersection of two hypersurfaces F_n and F_k in the projective space P^5 of degree n and k respectively with n >= k, such that the singularities of X are nodal and F_k is smooth. We prove that if the threefold X has at…

This is the third of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…

We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.

A multiplicative 3-matching in a group $G$ is a triple of sets $\{a_i\}, \{b_i\}, \{c_i\} \subset G$ such that $a_ib_jc_k = 1$ if and only if $i=j=k$. Here we record the fact that $\text{PSL}(2,p)$ has no multiplicative 3-matching of size…

Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature. Dewar et al.\ (Des.\ Codes Cryptogr.\ 45:1-17, 2007) studied the division of trinomials by a…

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar…

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…

We introduce the notion of ''maximal rank type'' for representations of quivers, which requires certain collections of maps involved in the representation to be of maximal rank. We show that real root representations of quivers are of…

For every positive integer $k$, we show that every graph of order $n$ at least $3k$ with more than $$\max\{{2k-1\choose 2}+(2k-1)(n-(2k-1)),{3k-1\choose 2}+(n-(3k-1))\}$$ edges has $k$ vertex disjoint cycles, which is a best possible…

We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best…

The expansion $F^{\triangle}$ of a graph $F$ is the graph obtained from $F$ by replacing each edge with a triangle. Lv \etal proposed a conjecture on the maximum number of triangles in a graph without $P_k^{\triangle}$ or $C_k^{\triangle}$…

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

In this note, we show that, if the Druzkowski mappings $F(X)=X+(AX)^{*3}$, i.e. $F(X)=(x_1+(a_{11}x_1+...+a_{1n}x_n)^3,...,x_n+(a_{n1}x_1+...+a_{nn}x_n)^3)$, satisfies $TrJ((AX)^{*3})=0$, then $rank(A)\leq 1/2(n+\delta)$ where $\delta$ is…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…