Cargando…
Mycielski Graphs and [Formula: see text] Proofs
Mycielski graphs are a family of triangle-free graphs [Formula: see text] with arbitrarily high chromatic number. [Formula: see text] has chromatic number k and there is a short informal proof of this fact, yet finding proofs of it via automated reasoning techniques has proved to be a challenging ta...
Autores principales: | Yolcu, Emre, Wu, Xinyu, Heule, Marijn J. H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326559/ http://dx.doi.org/10.1007/978-3-030-51825-7_15 |
Ejemplares similares
-
Subdivision of graphs in [Formula: see text]
por: Wijaya, Kristiana, et al.
Publicado: (2020) -
Genetic Programming [Formula: see text] Proof Search [Formula: see text] Automatic Improvement
por: Kocsis, Zoltan A., et al.
Publicado: (2017) -
Which graphs are rigid in [Formula: see text] ?
por: Dewar, Sean, et al.
Publicado: (2021) -
Observation of B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] and B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] decays
por: Tumasyan, A., et al.
Publicado: (2022) -
[Formula: see text] rule, [Formula: see text] and [Formula: see text] in [Formula: see text] and [Formula: see text] models with FCNC quark couplings
por: Buras, Andrzej J., et al.
Publicado: (2014)