HIGHLIGHTS
- who: A RT I C et al. from the CNRS, SCOP, Félix Viallet, France, Radboud University have published the article: Separation Choosability and Dense Bipartite Induced Subgraphs, in the Journal: (JOURNAL)
- what: The authors show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. The authors show this as a corollary to a more general result below, Theorem 3.1. The authors focus mostly on Conjecture 1.5. In the following result the authors determine up to a constant factor the largest average degree over all semi-bipartite induced . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.