Pages that link to "Item:Q789411"

The following pages link to A new proof of a theorem of Graham and Pollak (Q789411):

Displaying 33 items.

• A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
• On the decomposition of random hypergraphs (Q684118) (← links)
• On biclique partitions of the complete graph (Q686164) (← links)
• On decompositions of complete hypergraphs (Q1040837) (← links)
• Decomposition of product graphs into complete bipartite subgraphs (Q1073047) (← links)
• Clique partitions of the cocktail party graph (Q1076691) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• On tournament matrices (Q1183197) (← links)
• Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
• Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
• Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs (Q1392568) (← links)
• Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
• Decomposing the complete \(r\)-graph (Q1679321) (← links)
• Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
• On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
• Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
• Multicovering hypergraphs (Q2022167) (← links)
• Eigenvalues and clique partitions of graphs (Q2040995) (← links)
• Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
• Bipartite decomposition of random graphs (Q2347851) (← links)
• A polynomial space proof of the Graham-Pollak theorem (Q2427560) (← links)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
• More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)
• (Q4691789) (← links)
• (Q4691855) (← links)
• Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
• Decomposition of Random Graphs into Complete Bipartite Graphs (Q5744698) (← links)
• Finding biclique partitions of co-chordal graphs (Q6162046) (← links)
• A critical probability for biclique partition of \(G_{n,p}\) (Q6196153) (← links)
• Exact values and improved bounds on \(k\)-neighborly families of boxes (Q6201906) (← links)
• Complete bipartite decompositions of crowns, with applications to complete directed graphs (Q6567671) (← links)