Random Cyclic Triangle-Free Graphs of Prime Order

Yu Jiang, Meilian Liang, Yanmei Teng, Xiaodong Xu and Efthymios G. Tsionas

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: Cyclic triangle-free process (CTFP) is the cyclic analog of the triangle-free process. It begins with an empty graph of order n and generates a cyclic graph of order n by iteratively adding parameters, chosen uniformly at random, subject to the constraint that no triangle is formed in the cyclic graph obtained, until no more parameters can be added. The structure of a cyclic triangle-free graph of the prime order is different from that of composite integer order. Cyclic graphs of prime order have better properties than those of composite number order, which enables generating cyclic triangle-free graphs more efficiently. In this paper, a novel approach to generating cyclic triangle-free graphs of prime order is proposed. Based on the cyclic graphs of prime order, obtained by the CTFP and its variant, many new lower bounds on R3,t are computed, including R3,34≥230, R3,35≥242, R3,36≥252, R3,37≥264, R3,38≥272. Our experimental results demonstrate that all those related best known lower bounds, except the bound on R3,34, are improved by 5 or more.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5595919.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5595919.xml (application/xml)

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:hin:jjmath:5595919

DOI: 10.1155/2021/5595919

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().