A short proof of the middle levels theorem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10384207" target="_blank" >RIV/00216208:11320/18:10384207 - isvavai.cz</a>

Result on the web

<a href="https://discreteanalysisjournal.com/article/3659-a-short-proof-of-the-middle-levels-theorem" target="_blank" >https://discreteanalysisjournal.com/article/3659-a-short-proof-of-the-middle-levels-theorem</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.19086/da.3659" target="_blank" >10.19086/da.3659</a>

Result language

angličtina

Original language name

A short proof of the middle levels theorem

Original language description

Consider the graph that has as vertices all bitstrings of length 2n+1 with exactly n or n+1 entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts that this graph has a Hamilton cycle for any n greater or equal 1. In this paper we present a new proof of this conjecture, which is much shorter and more accessible than the original proof.

Czech name

—

Czech description

—

Type

J_SC - Article in a specialist periodical, which is included in the SCOPUS database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete Analysis [online]

ISSN

2397-3129

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

21. května

Country of publishing house

GB - UNITED KINGDOM

Number of pages

12

Pages from-to

1-12

UT code for WoS article

—

EID of the result in the Scopus database

2-s2.0-85049078832