Corpus ID: 16361401

Bowtie-free graphs have a Ramsey lift

@inproceedings{Hubivcka2014BowtiefreeGH,
  title={Bowtie-free graphs have a Ramsey lift},
  author={Jan Hubivcka and Jaroslav Nevsetvril},
  year={2014}
}
  • Jan Hubivcka, Jaroslav Nevsetvril
  • Published 2014
  • Mathematics, Computer Science
  • A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph have a Ramsey lift (expansion). This is the first non-trivial Ramsey class with a non-trivial algebraic closure. 
    A Ramsey class for Steiner systems
    • 7
    • PDF
    On positive local combinatorial dividing-lines in model theory
    • 2
    • PDF
    Ramsey Classes with Closure Operations
    • 3
    • PDF
    Ramsey classes with forbidden homomorphisms and a closure
    • 5
    • Highly Influenced
    • PDF
    Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
    • 4
    • PDF
    Ramsey properties and extending partial automorphisms for classes of finite structures
    • 17
    • Highly Influenced
    • PDF
    Ramsey theorem for designs

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES
    Some remarks on universal graphs
    • 17
    Universal Graphs with Forbidden Subgraphs and Algebraic Closure
    • 75
    • Highly Influential
    • PDF
    The partite construction and ramsey set systems
    • 60
    • Highly Influential
    • PDF
    Survey of results on the maximum genus of a graph
    • 31
    Ramsey Classes and Homogeneous Structures
    • 90
    For graphs there are only four types of hereditary Ramsey classes
    • 44
    Ramsey classes with forbidden homomorphisms and a closure
    • 5
    • PDF
    The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments
    • 168