DeepAI AI Chat
Log In Sign Up

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets

by   Stefan Felsner, et al.

We prove that in every cover of a Young diagram with 2kk steps with generalized rectangles there is a row or a column in the diagram that is used by at least k+1 rectangles. We show that this is best-possible by partitioning any Young diagram with 2kk-1 steps into actual rectangles, each row and each column used by at most k rectangles. This answers two questions by Kim et al. (2018). Our results can be rephrased in terms of local covering numbers of difference graphs with complete bipartite graphs, which has applications in the recent notion of local dimension of partially ordered sets.


page 1

page 2

page 3

page 4


On Covering Numbers, Young Diagrams, and the Local Dimension of Posets

We study covering numbers and local covering numbers with respect to dif...

On difference graphs and the local dimension of posets

The dimension of a partially-ordered set (poset), introduced by Dushnik ...

Local Boxicity, Local Dimension, and Maximum Degree

In this short note we focus on two recently introduced parameters in the...
02/16/2023 Compressing Linear Set Diagrams

Linear diagrams are used to visualize set systems by depicting set membe...

Online Bipartite Matching via Smoothness

The analysis of online bipartite matching of Eden et al. (2021) is a smo...

Limits of Ordered Graphs and Images

The emerging theory of graph limits exhibits an interesting analytic per...

A Link Diagram Visualizing Relations between Two Ordered Sets

This article provides a link diagram to visualize relations between two ...