Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
Perturbative time and frequency allocations for RFID reader networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
Let G be a triangle‐free graph on n points with m edges and vertex degrees d1, d2,…, dn. Let k be the maximum number of edges in a bipartite subgraph of G. In this note we show that k ⩾ m/2 + Σ **image** √di. It follows as a corollary that k ⩾ m/2 + cm3/4. © 1992 Wiley Periodicals, Inc.