The following pages link to (Q5525916):
Displaying 19 items.
- Biclique covers and partitions (Q405095) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
- Hypergraph coverings and local colorings (Q1121913) (← links)
- Distances in orientations of graphs (Q1219300) (← links)
- Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices (Q1240259) (← links)
- Upper and lower bounds for graph-diameter problems with application to Record allocation (Q1257489) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- On the Decomposition of Graphs (Q3964612) (← links)
- Rainbow Saturation and Graph Capacities (Q4564887) (← links)
- Search When the Lie Depends on the Target (Q4915262) (← links)