The biclique covering number of grids

11/08/2018
by   Krystal Guo, et al.
0

We determine the exact value of the biclique covering number for all grid graphs.

READ FULL TEXT
research
04/28/2019

Generalizing the Covering Path Problem on a Grid

We study the covering path problem on a grid of R^2. We generalize earli...
research
11/11/2017

Natural exact covering systems and the reversion of the Möbius series

We prove that the number of natural exact covering systems of cardinalit...
research
07/29/2023

Locked Polyomino Tilings

A locked t-omino tiling is a tiling of a finite grid or torus by t-omino...
research
04/23/2023

Covering multigraphs with bipartite graphs

Hansel's lemma states that ∑_H∈ℋ|H| ≥ n log_2 n holds where ℋ is a colle...
research
11/02/2017

Network-size independent covering number bounds for deep networks

We give a covering number bound for deep learning networks that is indep...
research
05/05/2021

Comparative Analysis of Box-Covering Algorithms for Fractal Networks

Research on fractal networks is a dynamically growing field of network s...
research
08/28/2017

Cops and robber on grids and tori

This paper is a contribution to the classical cops and robber problem on...

Please sign up or login with your details

Forgot password? Click here to reset