Talk next monday
1 view
Skip to first unread message
kozmath
Sep 30, 2025, 2:29:49 PM (14 days ago) Sep 30
to Kolmogorov seminar on complexity, arturo...@uoh.cl
Dear participants of the Kolmogorov seminar
Next Monday, 6 October, there will be a talk by Arturo Merino (Universidad de O'Higgins) about 0,1-polyhedra.
6 October, 18:30 MSK, 17:30 Paris, 12:30 Santiago
Zoom:
https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09
A 0-1 polyhedron is a polyhedron whose vertices are 0,1 vectors. For example, for a given graph G, one can define a 0,1-polyhedron whose vertices are matchings of G.
There is a classical result that any 0,1-polyhedron admits a Hamiltonian path along its edges. The idea is to first try to understand this result, and then discuss what is known about efficient generation of the vertices of 0,1-polyhedra.
Sasha
Next Monday, 6 October, there will be a talk by Arturo Merino (Universidad de O'Higgins) about 0,1-polyhedra.
6 October, 18:30 MSK, 17:30 Paris, 12:30 Santiago
Zoom:
https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09
A 0-1 polyhedron is a polyhedron whose vertices are 0,1 vectors. For example, for a given graph G, one can define a 0,1-polyhedron whose vertices are matchings of G.
There is a classical result that any 0,1-polyhedron admits a Hamiltonian path along its edges. The idea is to first try to understand this result, and then discuss what is known about efficient generation of the vertices of 0,1-polyhedra.
Sasha
Reply all
Reply to author
Forward
0 new messages