#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1984

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Dmitry N. Kozlov
- Algorithms and computation in mathematics
- 2008

Combinatorial Algebraic Topology is concerned with computing algebraic invari-ants of combinatorially given cell complexes by combinatorial means. It arises from the quest of explicit descriptions of invariants in Algebraic Topology, and has applications in Discrete Mathematics. In this talk we shall outline the general philosophy of Combinatorial Algebraic… (More)

- D. N. Kozlov
- 1984

Hom (G, H) is a polyhedral complex defined for any two undirected graphs G and H. This construction was introduced by Lovász to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological properties of this class of complexes. We show that Hom (K 2 , Kn) is a boundary complex of a polytope, on which the natural… (More)

- Dmitry N. Kozlov
- 2005

- Dmitry N. Kozlov
- J. Comb. Theory, Ser. A
- 1999

To every directed graph G one can associate a complex (G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph Gn, where it leads to studying some interesting representations of the symmetric group and corresponds (via Stanley-Reisner correspondence) to… (More)

- DMITRY N. KOZLOV
- 2006

In this paper we study implications of folds in both parameters of Lovász' Hom(−, −) complexes. There is an important connection between the topological properties of these complexes and lower bounds for chromatic numbers. We give a very short and conceptual proof of the fact that if G − v is a fold of G, then bdHom(G, H) collapses onto bdHom(G − v, H),… (More)

- DMITRY N. KOZLOV
- 2003

For any two graphs G and H Lovász has defined a cell complex Hom (G, H) having in mind the general program that the algebraic invariants of these complexes should provide obstructions to graph col-orings. Here we announce the proof of a conjecture of Lovász concerning these complexes with G a cycle of odd length. More specifically, we show that If Hom… (More)

- Dmitry N Kozlov
- 1996

We introduce a new poset property which we call EC-shellability. It is more general than the more establishedconcept of EL-shellability, but still implies shellability. Because of the Theorem 3.10 EC-shellability is entitled to be called general lexicographic shellability. As an application of our new concept, we prove that intersectionlattices of orbit… (More)

- DMITRY N. KOZLOV
- 1999

Let ((n) denote the order complex of the partition lattice. The natural Sn-action on the set n] induces an Sn-action on ((n). We show that the regular CW complex ((n)=Sn is collapsible. Even more, we show that (()=Sn is collapsible, where is a suitable type selection of the partition lattice. This allows us to generalize and reprove in a conceptual way… (More)

- Dmitry N. Kozlov
- J. Comb. Theory, Ser. A
- 1999