Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks
For smooth convex disks $A$, i.e., convex compact subsets of the plane with non-empty interior and with at most one tangent at every boundary point, we classify the classes $G^{\text{hom}}(A)$ and $G^{\text{sim}}(A)$ of intersection graphs that can be obtained from homothets and similarities of $A$, respectively. Namely, we prove that $G^{\text{hom}}(A)=G^{\text{hom}}(B)$ if and only if $A$ and $B$ are affine equivalent, and $G^{\text{sim}}(A)=G^{\text{sim}}(B)$ if and only if $A$ and $B$ are similar.
Authors
- Mikkel Abrahamsen (ORCID: https://orcid.org/0000-0003-2734-4690)
- Bartosz Walczak (ORCID: https://orcid.org/0000-0002-5761-2564)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2026-11-20
- DOI
- https://doi.org/10.37236/12401
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00