𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison theorem for permanents and a proof of a conjecture on (t, m)-families

✍ Scribed by Joseph Y.-T Leung; W.-D Wei


Book ID
107885180
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
470 KB
Volume
61
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Proof of a Conjecture of BollobΓ‘s and Ko
✍ Yoshiyasu Ishigami πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

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

A Note on the Proof of Niho's Conjecture
✍ Hou, Xiang-dong πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 129 KB
A Simple Proof of Fryant’s Theorem
✍ Vemuri, M. K. πŸ“‚ Article πŸ“… 1995 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 186 KB