Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

COMBINATORICS
2006

favoriteEmaildiscussreport

91views more COMBINATORICS 2006»

Proof of an Intersection Theorem via Graph Homomorphisms

13 years 11 months ago

Proof of an Intersection Theorem via Graph Homomorphisms

Download www.wisdom.weizmann.ac.il

Irit Dinur, Ehud Friedgut

Real-time Traffic

COMBINATORICS 2006 |

claim paper

Related Content

» First order properties on nowhere dense structures

» Derandomizing the AW matrixvalued Chernoff bound using pessimistic estimators and applicat...

» Removing even crossings

» Modeling Students Reasoning About Qualitative Physics Heuristics for Abductive Proof Searc...

» On a Geometric Generalization of the Upper Bound Theorem

» Hardness Amplification via SpaceEfficient Direct Products

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

» Choiceless Computation and Symmetry

» Stability of a Multicast Tree

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Irit Dinur, Ehud Friedgut

Comments (0)