H. Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
....bipartite graph on the variables as vertices. Graham and Pollack [5] asked that howmany edge disjoint bipartite graphs can cover the edges of an n vertex complete graph. They proved that n ; 1 bipartite graphs are sufficient and necessary.Later,Tverberg gaveavery nice proof for this statement[27]. Having relaxed the disjointness property, Babai and Frankl [1]asked that what is the minimum number of bipartite graphs, whichcovers everyedgeofann vertex complete graph byanoddmultiplicity. Babai and Frankl proved that (n ; 1) 2 bipartite graphs are necessary. The optimum upper bound for the ....
H. Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982.
A Trade-Off for Covering the Off-Diagonal Elements of Matrices - Grolmusz (Correct)
....is optimal. 1.1 Related work Graham and Pollack [GP72] asked that how many edge disjoint bipartite graphs can cover the edges of an n vertex complete graph. They proved that n Gamma 1 bipartite graphs are sufficient and necessary. Later, Tverberg gave a very nice proof for this statement [Tve82]. Having relaxed the disjointness property, Babai and Frankl [BF92] asked that what is the minimum number of bipartite graphs, which covers every edge of an n vertex complete graph an odd multiplicity. Babai and Frankl proved that (n Gamma 1) 2 bipartite graphs are necessary. The optimum upper ....
Helge Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982.
Proof of a Conjecture of Frankl and Furedi - Ramanan (3 citations) (Correct)
.... F is a hypergraph on X = f1; 2; 3; ng such that 1 jE F j k 8 E; F 2 F ; E 6= F; then jF j k X i=0 n Gamma 1 i : We generalise a method of Palisse and our proof technique can be viewed as a variant of the technique used by Tverberg to prove a result of Graham and Pollak [10, 11, 14]. Our proof technique is easily described. First, we derive an identity satisfied by a hypergraph F using its intersection properties. From this identity, we obtain a set of homogeneous linear equations. We then show that this defines the zero subspace of IR jF j : Finally, the desired bound on ....
....attaining the bound in Theorem 1. This is done in the paper of Frankl and Furedi for the cases they deal with [7] For other related conjectures, see the papers of Frankl and Furedi, and Snevily [7, 13] In 1982, Tverberg gave a simple linear algebraic proof of a result of Graham and Pollak [10, 14]. In 1993, Palisse gave an elegant proof of Bose s theorem, using the ideas of Tverberg [11] We extend the method of Palisse to prove the FranklF uredi conjecture. As an indication of how our proof technique can be generalised, we give a proof of the following theorem for non uniform hypergraphs. ....
H. Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982. 22
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
No context found.
H. Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982.
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
No context found.
H. Tverberg. On the decomposition of K n into complete bipartite graphs. Journal of Graph Theory, 6:493--494, 1982.
Biclique Decompositions and Hermitian Rank - David Gregory (Correct)
No context found.
H. Tverberg, On the decomposition of K n into complete bipartite graphs, J. Graph Theory 6:493--494 (1982).
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