The triangle-free graphs which are competition graphs of multipartite tournaments
Myungho Choi, Minki Kwak, Suh-Ryung Kim
TL;DR
This paper characterizes all triangle-free graphs that can be represented as competition graphs of multipartite tournaments, providing a complete classification in this specific graph-theoretic context.
Contribution
It offers a complete characterization of triangle-free graphs as competition graphs of multipartite tournaments, filling a gap in the understanding of these graph classes.
Findings
Identified all triangle-free graphs that are competition graphs of multipartite tournaments.
Provided a classification theorem for these graphs.
Enhanced understanding of the structure of competition graphs in multipartite settings.
Abstract
In this paper, we discover all the triangle-free graphs that are competition graphs of multipartite tournaments.
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 Labeling and Dimension Problems · Optimization and Search Problems