National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Computing and estimating ordered Ramsey numbers
Poljak, Marian ; Balko, Martin (advisor) ; Hubička, Jan (referee)
We study ordered Ramsey numbers, which are an analogue of the classical Ramsey numbers for ordered graphs. We improve some already obtained results for a special class of ordered matchings and disprove a conjecture of Rohatgi. We expand the classical notion of Ramsey goodness to the ordered case and we attempt to characterize all Ram- sey good connected ordered graphs. We outline how Ramsey numbers can be obtained computationally and describe our SAT solver based utility developed to achieve this goal, which might be of use to other researchers studying this topic. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.