Related papers: Simultaneous generating sets for flags
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\in \mathbb{N}$ with $a_1+a_2+a_3\leq n-2$, we show there exists a matching $M$ of $G$ with…
We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…
The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…
We study the space of all triples of projective lines in $\mathbb{RP}^n$ such that any line in a triple intersects the two others at distinct points. We show that for $n=2$ and $3$ these spaces are homotopically equivalent to the real…
We define the class of admissible linear embeddings of flag varieties. The definition is given in the general language of algebraic geometry. We then prove that an admissible linear embedding of flag varieties has a certain explicit form in…
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…
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…
In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…
For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…
For each $d\leq3$, we construct a finite set $F_d$ of multigraphs such that for each graph $H$ of girth at least $5$ obtained from a multigraph $G$ by subdividing each edge at least two times, $H$ has twin-width at most $d$ if and only if…
We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…
Using Grothendieck's "functor of points" approach to algebraic geometry, we define a new infinite-dimensional algebro-geometric flag space as a $k$-functor (for $k$ a ring) which maps a $k$-algebra $R$ to the set of certain well-ordered…
We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two…
Let a split element of a connected semisimple Lie group act on one of its flag manifolds. We prove that each connected set of fixed points of this action is itself a flag manifold. With this we can obtain the generalized Bruhat…
Label the vertices of the complete graph $K_v$ with the integers $\{0, 1, \ldots, v-1\}$ and define the {\em length} $\ell$ of the edge between distinct vertices labeled $x$ and $y$ by $\ell(x,y) = \min( |y-x|, v - |y-x| )$. A {\em…