Concerning FAT Colorings of Graphs
Saeed Shaebani

TL;DR
This paper proves the existence of an infinite sequence of regular graphs with positive degree that admit specific FAT colorings, answering an open question about their existence.
Contribution
It explicitly constructs infinitely many non-homomorphically equivalent regular graphs that admit FAT colorings with given parameters, confirming their existence.
Findings
Constructed an infinite sequence of such graphs.
Confirmed the existence of FAT colorings with specified parameters.
Provided explicit examples of non-homomorphically equivalent graphs.
Abstract
Let be a graph and let be a color set of cardinality . Suppose is a (not necessarily proper) vertex coloring whose all color classes are , , , , each of which is nonempty. The vertex coloring is said to be a {\it FAT -coloring of } if there exist real numbers and , both in , such that for every vertex and every color class the following equalities hold: Let be a fixed integer, and let and be some fixed rational numbers satisfying . It was asked for the existence of a graph with $\delta (G)…
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
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Limits and Structures in Graph Theory
