Thomas Zaslavsky
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
1975/01/01 by Thomas Zasĺavsky, Thomas Zaslavsky · 3 citations
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics #Computer science #Face (sociological concept) #Hyperplane #Limits and Structures in Graph Theory #Mathematics #Mathematics and Applications #Social science #Sociology #Space (punctuation)
- A Meshalkin theorem for projective geometries
2001/12/31 by Matthias Beck, Thomas Zaslavsky · 1 citation
Mathematics · #math.CO #msc:05D05 #msc:51E20 #msc:06A07
- Frame Matroids and Biased Graphs
1994/05/01 by Thomas Zaslavsky, Thomas Zasĺavsky · 1 citation
Biochemistry, Genetics and Molecular Biology · Engineering · Mathematics · #Combinatorics #Discrete mathematics #Dual graph #Finitary #Graph #Graphic matroid #Mathematics #Matroid #Matroid partitioning #Melanoma and MAPK Pathways #Planar graph #graph theory and CDMA systems
- A Shorter, Simpler, Stronger Proof of the Meshalkin–Hochberg–Hirsch Bounds on Componentwise Antichains
2002/10/01 by Matthias Beck, Thomas Zaslavsky, Thomas Zasĺavsky · 2 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Combinatorics #Functional Equations Stability Results #Holomorphic and Operator Theory #Mathematical economics #Mathematics
- A Meshalkin theorem for projective geometries
2003/05/01 by Matthias Beck, Thomas Zasĺavsky, Thomas Zaslavsky · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algebra over a field #Computer science #Limits and Structures in Graph Theory #Mathematics #Projective test #Pure mathematics #graph theory and CDMA systems