𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Isolating an Odd Number of Elements and Applications in Complexity Theory

✍ Scribed by S. Gupta

Publisher
Springer
Year
1998
Tongue
English
Weight
131 KB
Volume
31
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles in bipartite graphs and an applic
Cycles in bipartite graphs and an application in number theory
✍ GΓ‘bor N. SΓ‘rkΓΆzy πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 304 KB

Let G = G(A, B) be a bipartite graph with IAl = u, IBl = U , and let I be a positive integer. In this paper we prove the following result: If u 4 u, uu 5 n, rn = J€(G)I, and then G contains a C2/.