Cliques and Chromatic Number in Multiregime Random Graphs

Ghurumuruhan Ganesan ()
Additional contact information
Ghurumuruhan Ganesan: Institute of Mathematical Sciences, HBNI

Sankhya A: The Indian Journal of Statistics, 2022, vol. 84, issue 2, No 5, 509-533

Abstract: Abstract In this paper, we study cliques and chromatic number in the random subgraph Gn of the complete graph Kn on n vertices, where each edge is independently open with a probability pn. Associating Gn with the probability measure ℙn, we say that the sequence {ℙn} is multiregime if the edge probability sequence {pn} is not convergent. Using a recursive method we obtain uniform bounds on the maximum clique size and chromatic number for such multiregime random graphs.

Keywords: Multiregime random graphs; Cliques; Chromatic number; Primary 60J10; 60K35; Secondary: 60C05; 62E10; 90B15; 91D30 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13171-020-00205-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sankha:v:84:y:2022:i:2:d:10.1007_s13171-020-00205-4

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/13171

DOI: 10.1007/s13171-020-00205-4

Access Statistics for this article

Sankhya A: The Indian Journal of Statistics is currently edited by Dipak Dey

More articles in Sankhya A: The Indian Journal of Statistics from Springer, Indian Statistical Institute
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().