Pages that link to "Item:Q3967567"
From MaRDI portal
The following pages link to On the decomposition ofkn into complete bipartite graphs (Q3967567):
Displayed 50 items.
- Clique versus independent set (Q402465) (← links)
- Biclique covers and partitions (Q405095) (← links)
- Eigenvalues of complete multipartite graphs (Q442357) (← links)
- 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)
- A short proof of Fisher's inequality (Q686507) (← links)
- On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs (Q731372) (← links)
- A new proof of a theorem of Graham and Pollak (Q789411) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- On the decomposition of graphs into complete bipartite graphs (Q995755) (← 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)
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs (Q1106468) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- A generalization of Fisher's inequality (Q1279662) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Proof of a conjecture of Frankl and Füredi (Q1369678) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Decomposing the complete \(r\)-graph (Q1679321) (← links)
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes (Q1689958) (← links)
- Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
- Characterizing the flow equivalent trees of a network (Q1811121) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- A tree whose complement is not eigensharp (Q1971045) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- Eigenvalues and clique partitions of graphs (Q2040995) (← links)
- No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\) (Q2046444) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
- Bipartite decomposition of random graphs (Q2347851) (← links)
- Helge Tverberg is eighty: a personal tribute (Q2403688) (← links)
- On 2-colored graphs and partitions of boxes (Q2422239) (← 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)
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes (Q2672548) (← links)
- More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)
- (Q4691789) (← links)
- (Q4691855) (← links)
- Decompositions of some regular graphs into unicyclic graphs of order five (Q5197547) (← 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)