𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number

✍ Scribed by Stefan Felsner; Vijay Raghavan; Jeremy Spinrad

Book ID
111603075
Publisher
Springer Netherlands
Year
2003
Tongue
English
Weight
139 KB
Volume
20
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ramsey numbers for sets of small graphs
Ramsey numbers for sets of small graphs
✍ Holger Brandes; Heiko Harborth; Hans-Dietrich O.F. Gronau; Christian Schwahn πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 733 KB

The Ramsey number r=r(G1-GZ-...-G,,,,H1-Hz-...-Hn) denotes the smallest r such that every 2-coloring of the edges of the complete graph K, contains a subgraph Gi with all edges of one color, or a subgraph Hi with all edges of a second color. These Ramsey numbers are determined for all sets of graph

True cofinality and bounding number for
True cofinality and bounding number for small products of partial orders
✍ Stefan Neumann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 194 KB

We replace Shelah's notion of true coΓΏnality by the notion of the bounding number for an arbitrary partial order and begin to develop a theory similar to Shelah's pcf theory, which gives many analog results, including the existence of the so-called generators, for the more general case of products o