Pages that link to "Item:Q3710552"
From MaRDI portal
The following pages link to How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? (Q3710552):
Displaying 10 items.
- Maximal equilateral sets (Q368756) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- Cube tiling and covering a complete graph (Q1173697) (← links)
- Decompositions of complete multigraphs derived from Hadamard matrices (Q1399905) (← links)
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes (Q1689958) (← links)
- On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
- Nearly neighbourly families of standard boxes (Q2278122) (← links)
- Putting convex \(d\)-polytopes inside frames (Q2413557) (← links)
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) (Q6056562) (← links)