Pages that link to "Item:Q1117950"
From MaRDI portal
The following pages link to Explicit matchings in the middle levels of the Boolean lattice (Q1117950):
Displaying 26 items.
- Construction of 2-factors in the middle layer of the discrete cube (Q444915) (← links)
- An update on the middle levels problem (Q1044886) (← links)
- Lexicographic matchings cannot form Hamiltonian cycles (Q1110538) (← links)
- Boolean layer cakes (Q1285779) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- An explicit 1-factorization in the middle of the Boolean lattice (Q1320401) (← links)
- The antipodal layers problem (Q1322186) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Perfect matchings in antipodally colored lattice of subsets (Q1761465) (← links)
- Explicit 2-factorizations of the odd graph (Q1765963) (← links)
- Monotone Gray codes and the middle levels problem (Q1805053) (← links)
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets (Q1898340) (← links)
- Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice (Q2032907) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- The prism over the middle-levels graph is Hamiltonian (Q2490424) (← links)
- On the central levels problem (Q2692785) (← links)
- Proof of the middle levels conjecture (Q2809275) (← links)
- On hamiltonian cycles in the prism over the odd graphs (Q3096955) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- A short proof of the middle levels theorem (Q4645033) (← links)
- A numeral system for the middle-levels graphs (Q4958054) (← links)
- (Q5002744) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A local injective proof of log-concavity for increasing spanning forests (Q6056738) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
