activity
20022008
most citedWI-posets, graph complexes and Z_2-equivalences

3 citations · 7 across the 12 of their papers we have counts for

collaborators
Showing math.COShow all

10 papers · 1 filter

math.CO20081 cited

Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem

Sinisa Vrecica, Rade Zivaljevic

The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-Ma…

math.CO2007

Oriented matroids and Ky Fan's theorem

Rade T. Zivaljevic

L. Lovasz has shown that Sperner's combinatorial lemma admits a generalization involving a matroid defined on the set of vertices of the associated triangulation. Inspired by this…

math.CO2005

The Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics

Mark de Longueville, Rade T. Zivaljevic

This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial c…

math.CO2005

Parallel transport of -complexes and the Lovasz conjecture

Rade T. Zivaljevic

The groupoid of projectivities, introduced by M. Joswig, serves as a basis for a construction of parallel transport of graph and more general -complexes. In this framework we…

math.CO20041 cited

Equipartitions of measures in

Rade T. Zivaljevic

We prove that each measure in admits an equipartition by 4 hyperplanes, provided that it is symmetric with respect to a 2-dimensional, affine subspace of . Moreo…

math.CO20043 cited

WI-posets, graph complexes and Z_2-equivalences

Rade T. Zivaljevic

We introduce WI-posets as intermediate objects in the study of Z_2-homotopy types of graph complexes. It turns out that (almost) all graph complexes associated to a graph can be vi…