Publications > Preprint server > Preprint Number 2509
Preprint Number 2509
2509. Yayi Fu Erdős-Hajnal property for dp-minimal graphs E-mail: Submission date: 26 October 2023 Abstract: We show that for each integer d ≥ 2, the family ℱ_d= {G=(V,E):G and Ḡ have no d-tuple (a_1,...,a_d) satisfying that there exists {b_{ij}}_{1 ≤ i < j ≤ d} such that for all i,j ∈ {1,...,d}, E(b_{ij},a_i) ∧ E(b_{ij},a_j) ∧ ⋀_{k ≠ i,j} ¬ E(b_{ij},a_k)} has Erdős-Hajnal property. In particular, if T is a dp-minimal theory, ℳ ⊧ T and E a definable symmetric binary relation, then the family {G=(V,E): V ⊆ M a finite set and for every two vertices x,y ∈ V, E(x,y) iff ℳ ⊧ E(x,y)} has Erdős-Hajnal property. As a corollary, Erdős-Hajnal property holds for VC-density 1 graphs. Mathematics Subject Classification: Keywords and phrases: |
Last updated: November 3 2023 12:10 | Please send your corrections to: |