{
  "id": "2311.11733",
  "version": "v1",
  "published": "2023-11-20T12:56:45.000Z",
  "updated": "2023-11-20T12:56:45.000Z",
  "title": "Linearity Property of Unique Colourings in Random Graphs",
  "authors": [
    "Ghurumuruhan Ganesan"
  ],
  "categories": [
    "math.CO",
    "math.PR"
  ],
  "abstract": "In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned unique colours and use vertex partitioning and the probabilistic method to show that the minimum number of colours needed grows linearly with the uniqueness parameter, unlike both conflict-free and injective colourings. We argue how the unboundedness of the vertex neighbourhoods influences the linearity property and illustrate our case with an example involving treeunique colourings in random graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-11-20T12:56:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random graphs",
      "linearity property",
      "vertex neighbourhoods influences",
      "study unique colourings",
      "injective colourings"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}