539 citations · 976 across the 32 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 16 cited
Invariant random matchings in Cayley graphs
Endre Csoka, Gabor Lippner
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching.…
math.CO2012
Two Layer 3D Floor Planning
Paul Horn, Gabor Lippner
A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits…
math.CO2012
Positive graphs
Omar Antolín Camarena, Endre Csóka, Tamás Hubai +2
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graph…