10 search results - page 1 / 2 » Proof of an Intersection Theorem via Graph Homomorphisms |
COMBINATORICS
2006
13 years 4 months ago
2006
JSYML
2010
12 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
ECCC
2006
13 years 4 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
JCT
2007
13 years 4 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
ITS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...