𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite Subgraphs and Quasi-Randomness

✍ Scribed by Jozef Skokan; Lubos Thoma

Publisher
Springer Japan
Year
2004
Tongue
English
Weight
306 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite induced subgraphs and well-qua
Bipartite induced subgraphs and well-quasi-ordering
✍ Nicholas Korpelainen; Vadim V. Lozin πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs that are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from [J Graph Theory 16 (1992), 489-502], we prove that P 7 -free bipartite g

Bipartite subgraphs
Bipartite subgraphs
✍ Noga Alon πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 455 KB
On maximum bipartite subgraphs
On maximum bipartite subgraphs
✍ GΓΌnther Malle πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 314 KB

## Abstract In this paper are investigated maximum bipartite subgraphs of graphs, i.e., bipartite subgraphs with a maximum number of edges. Such subgraphs are characterized and a criterion is given for a subgraph to be a unique maximum bipartite subgraph of a given graph. In particular maximum bipa

Small bipartite subgraph polytopes
Small bipartite subgraph polytopes
✍ Laura Galli; Adam N. Letchford πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 272 KB
On Ramsey graphs without bipartite subgr
On Ramsey graphs without bipartite subgraphs
✍ Jaroslav NeΕ‘etΕ™il; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 388 KB

NeSetfil, J. and V. Riidl, On Ramsey graphs without bipartite subgraphs, Discrete Mathematics 101 (1992) 223-229. We prove that for every graph H without triangles and K,,,,,m, n G 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erd& and Faudree. Moreover we