Neighborly Families of Boxes and Bipartite Coverings
نویسنده
چکیده
A bipartite covering of order k of the complete graph Kn on n vertices is a collection of complete bipartite graphs so that every edge of Kn lies in at least 1 and at most k of them. It is shown that the minimum possible number of subgraphs in such a collection is Θ(kn1/k). This extends a result of Graham and Pollak, answers a question of Felzenbaum and Perles, and has some geometric consequences. The proofs combine combinatorial techniques with some simple linear algebraic tools.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملBipartite covering graphs
In this paper we study when a bipartite graph is a covering of a non-bipartite graph. We give a characterization of all coverings in terms of factoring the covering map through the canonical double covering. We also consider regular bipartite coverings described in terms of voltage assignments. We give an algebraic characterization of such coverings involving the subgroup generated by voltages ...
متن کاملHIGHER ORDER MATCHING POLYNOMIALS AND d-ORTHOGONALITY
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...
متن کاملBipartite Graphs and Coverings
In many real world applications, data are organized by coverings, not partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to real world application. The covering is one of core concepts in covering-based rough ...
متن کاملOne-sided coverings of colored complete bipartite graphs
Assume that the edges of a complete bipartite graph K(A,B) are colored with r colors. In this paper we study coverings of B by vertex disjoint monochromatic cycles, connected matchings, and connected subgraphs. These problems occur in several applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013