𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An extremal problem for finite topologies and distributive lattices

✍ Scribed by Richard P Stanley

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
277 KB
Volume
14
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 119 KB πŸ‘ 2 views
An extremal problem for subdivisions ofK
An extremal problem for subdivisions ofK?5
✍ Mader, W. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 248 KB πŸ‘ 1 views

It is proved that every graph G with G β‰₯ 2|G| -5, |G| β‰₯ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.

An extremal problem for H-linked graphs
An extremal problem for H-linked graphs
✍ Alexandr Kostochka; Gexin Yu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 167 KB πŸ‘ 1 views

## Abstract We introduce the notion of __H__‐linked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,…,__w__~m~. A graph __G__ is __H__‐__linked__ if for every choice of vertices Ο…~1~,…, Ο…~m~ in __G__, there exists a subdivision of __H__ in __G__ such that Ο…~i~ is the branch vertex