Minimal definable graphs of definable chromatic number at least three (Q5149654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1017/fms.2020.58 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3127619189 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1906.08373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurable versions of the Lovász local lemma and measurable graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal definable graphs of definable chromatic number at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smooth ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential countability of treeable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurable chromatic and independence numbers for ergodic graphs and group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An antibasis result for graphs of infinite Borel chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of the product of two 4-chromatic graphs is 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Glimm-Effros Dichotomy for Borel Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baire-class $\xi $ colorings: The first three levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A determinacy approach to Borel combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel circle squaring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph-theoretic approach to descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EXISTENCE OF LARGE ANTICHAINS FOR DEFINABLE QUASI-ORDERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite versus infinite: an insufficient shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Hedetniemi's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity problem for Borel graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/FMS.2020.58 / rank
 
Normal rank

Latest revision as of 16:07, 30 December 2024

scientific article; zbMATH DE number 7309668
Language Label Description Also known as
English
Minimal definable graphs of definable chromatic number at least three
scientific article; zbMATH DE number 7309668

    Statements

    Minimal definable graphs of definable chromatic number at least three (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 2021
    0 references
    Borel bipartite
    0 references
    Borel coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references