scientific article; zbMATH DE number 970791
From MaRDI portal
Publication:5688995
zbMath0863.05065MaRDI QIDQ5688995
Publication date: 11 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic combinatorics (05E99) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (20)
Regarding two conjectures on clique and biclique partitions ⋮ Some improved bounds on communication complexity via new decomposition of cliques ⋮ Maximal equilateral sets ⋮ New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) ⋮ Clique versus independent set ⋮ Biclique covers and partitions ⋮ Decompositions of complete multigraphs derived from Hadamard matrices ⋮ On the biclique cover of the complete graph ⋮ Finding biclique partitions of co-chordal graphs ⋮ Exact values and improved bounds on \(k\)-neighborly families of boxes ⋮ A counterexample to the Alon-Saks-Seymour conjecture and related problems ⋮ Biclique cover and local clique cover of graphs ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Some new bounds for cover-free families through biclique covers ⋮ Multicovering hypergraphs ⋮ Nearly neighbourly families of standard boxes ⋮ On covering graphs by complete bipartite subgraphs ⋮ The biclique covering number of grids ⋮ Ordered biclique partitions and communication complexity problems ⋮ Bipartite decomposition of random graphs
This page was built for publication:
