We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.

The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.

let $g$ be a finite group‎. ‎we say that $g$ has emph{spread} r if for any set of distinct non-trivial elements of $g$ $x:={x_1,ldots‎, ‎x_r}subset g^{#}$ there exists an element $yin g$ with the property that $langle x_i,yrangle=g$ for every $1leq ileq r$‎. ‎we say $g$ has emph{exact spread} $r$ if $g$ has spread $r$ but not $r+1$‎. ‎the spreads of finite simple groups and their decorations ha...

We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any givenN and k, while allowing the actual payments to be made on-line, namely without the need to know all payment ...