𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universality among graphs omitting a complete bipartite graph

✍ Scribed by Saharon Shelah

Book ID
118786684
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
428 KB
Volume
32
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs omitting sums of complete graphs
Graphs omitting sums of complete graphs
✍ Cherlin, Gregory; Shi, Niandong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 119 KB πŸ‘ 2 views

For every finite m and n there is a finite set {G 1 , . . . , G l } of countable (m β€’ K n )-free graphs such that every countable (m β€’ K n )-free graph occurs as an induced subgraph of one of the graphs G i .

Packing two bipartite graphs into a comp
Packing two bipartite graphs into a complete bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Complete bipartite factorisations by com
Complete bipartite factorisations by complete bipartite graphs
✍ N. Martin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 887 KB

We study complete Kp,q-factorisations of Kin, n, Simple necessary conditions are found and we conjecture that these conditions are also sufficient. A general construction is given to find infinite families of factorisations proving the conjecture in many cases. The conjecture is proved for Kl,q-fact

Pagenumber of complete bipartite graphs
Pagenumber of complete bipartite graphs
✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 929 KB