Chargement en cours...
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...
Enregistré dans:
| Publié dans: | Theory and Applications of Satisfiability Testing – SAT 2020 |
|---|---|
| Auteurs principaux: | , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
2020
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7326559/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51825-7_15 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|