𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of linear extensions of bipartite graphs

✍ Scribed by Grzegorz Stachowiak

Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
124 KB
Volume
5
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

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 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(

Approximating the number of linear exten
Approximating the number of linear extensions
✍ Kevin Ewacha; Ivan Rival; Nejib Zaguia πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 737 KB

We approximate the number of linear extensions of an ordered set by counting "critical" suborders.

The rainbow number of matchings in regul
The rainbow number of matchings in regular bipartite graphs
✍ Xueliang Li; Zhixia Xu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular