Ferrers Dimension and Boxicity
Soumyottam Chatterjee, Shamik Ghosh
TL;DR
This paper investigates the relationship between the boxicity of undirected graphs and the Ferrers dimension of directed graphs, providing insights into their theoretical connection.
Contribution
It introduces a novel analysis linking boxicity and Ferrers dimension, enhancing understanding of their interplay in graph theory.
Findings
Established a theoretical relationship between boxicity and Ferrers dimension
Provided bounds connecting the two graph parameters
Suggested potential applications in graph representation
Abstract
This note explores the relation between the boxicity of undirected graphs and the Ferrers dimension of digraphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Combinatorial Mathematics · Graph Labeling and Dimension Problems