𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The choice number of random bipartite graphs

✍ Scribed by Noga Alon; Michael Krivelevich

Publisher
Springer
Year
1998
Tongue
English
Weight
459 KB
Volume
2
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The random bipartite nearest neighbor gr
The random bipartite nearest neighbor graphs
✍ Boris Pittel; Robert S. Weishaar πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 301 KB

The bipartite kth nearest neighbor graphs B are studied. It is shown that B k 1 has a limiting expected matching number of approximately 80% of its vertices, that with high Ε½ . probability whp B has at least 2 log nr13 log log n vertices not matched, and that whp B 2 3 does have a perfect matching.

On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
✍ Odile Favaron; Pedro Mago; Oscar Ordaz πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

The number of linear extensions of bipar
The number of linear extensions of bipartite graphs
✍ Grzegorz Stachowiak πŸ“‚ Article πŸ“… 1988 πŸ› Springer Netherlands 🌐 English βš– 124 KB

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(