✦ LIBER ✦

On Zariski tangent spaces of Schubert varieties, and a proof of a conjecture of Deodhar

✍ Scribed by Patrick Polo

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 758 KB
Volume: 5
Category: Article
ISSN: 0019-3577
DOI: 10.1016/0019-3577(94)90019-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of Aris: Proof and remar

On a conjecture of Aris: Proof and remarks

✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views

Proof of a conjecture on game domination

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on fractional Rams

Proof of a conjecture on fractional Ramsey numbers

✍ Jason Brown; Richard Hoshino 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, …, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this

Proof of a conjecture on irredundance pe

Proof of a conjecture on irredundance perfect graphs

✍ Lutz Volkmann; Vadim E. Zverovich 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract Let __ir__(__G__) and γ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=γ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel

Proof of a Conjecture of Ehrenborg and S

Proof of a Conjecture of Ehrenborg and Steingrı́msson on Excedance Statistic

✍ Yi Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We give an affirmative answer to a conjecture of Ehrenborg and Steingrímsson on the general log-concavity of the excedance statistic.

Proof of a conjecture of Häggkvist on cy

Proof of a conjecture of Häggkvist on cycles and independent edges

✍ Kenneth A. Berman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A graph G of order n is a ck-graph if for every pair of d~tinct, nonadlacenl veJtlces x and y' d(x)+d(y)>~n+k where d(v) denotes the degree of a vertex v In this paper, we prove the