A note on extremal results on directed acyclic graphs
A. Mart\'inez-P\'erez, L. Montejano, D. Oliveros
TL;DR
This paper investigates extremal properties of directed acyclic graphs (DAGs) and their relation to intersection graphs of boxes with transverse intersections, providing insights into their structural limits.
Contribution
It introduces new extremal results connecting DAGs with intersection graphs of boxes, expanding understanding of their structural boundaries.
Findings
Identifies extremal bounds for DAGs related to intersection graphs.
Establishes relationships between DAG properties and box intersection graphs.
Provides theoretical insights into the extremal behavior of these graph families.
Abstract
The family of Directed Acyclic Graphs as well as some related graphs are analyzed with respect to extremal behavior in relation with the family of intersection graphs for families of boxes with transverse intersection.
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 · Graph theory and applications · Limits and Structures in Graph Theory