Nigel Martin, Richard Stong  Home/Search
Context
Related
| combinatorics.org/Volume...v10i1r37.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: combinatorics.org/Volu...v10i1toc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Suppose p<qare odd and relatively prime. In this paper we complete the proof that K n,n has a factorisation into factors F whose components are copies of K p,q if and only if n is a multiple of pq(p+q). The final step is to solve the "c-value problem" of Martin. This is accomplished by proving the following fact and some variants: For any 0 n, there exists a sequence (# 1 ,# 2 ,...,# 2k+1 ) of (not necessarily distinct) permutations of {1, 2,...,n} such that each value in {-k,1 -... (Update)
Active bibliography (related documents):
3.0: Permutation Separations and Complete Bipartite Factorisations.. - Martin, Stong (2003) (Correct)
Similar documents based on text: More All
0.2: Probabilistic Counting Algorithms for Data Base Applications - Flajolet, Martin (1985) (Correct)
0.1: Perfect factorisations of bipartite graphs and Latin squares.. - Wanless (1999) (Correct)
0.1: Extensions Of Umbral Calculus II: Double Delta Operators.. - Clarke, Hunton, Ray (1995) (Correct)
BibTeX entry: (Update)
@misc{ martin-permutation,
author = "Nigel Martin and Richard Stong",
title = "Permutation Separations and Complete Bipartite Factorisations of K_n,n",
url = "citeseer.ist.psu.edu/article/martin03permutation.html" }
Citations (may not include all citations):4 factorization of complete bipartite graphs (context) - Ushio - 1988
4 factorization of complete bipartite graphs (context) - Ushio, Tsuruno - 1991
2 Complete bipartite factorisations by complete bipartite grap.. (context) - Martin - 1997 ACM
2 Balanced bipartite graphs may be completely star-factored (context) - Martin - 1997
2 factorization of complete bipartite graphs (context) - Du - 1998
2 factorizations of a complete bipartite graph (context) - Wang - 1994
1 Complete bipartite factorisations of K n (context) - Martin - 2003
Documents on the same site (http://www.combinatorics.org/Volume_10/v10i1toc.html): More
A Note on Graph Coloring Extensions and List-Colorings - Axenovich (2003) (Correct)
Packing 10 or 11 Unit Squares in a Square - Stromquist (2003) (Correct)
Global Defensive Alliances in Graphs - Haynes, Hedetniemi, Henning (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC