1302 search results - page 39 / 261 » Free-Style Theorem Proving |
RSA
2010
13 years 6 months ago
2010
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
ORDER
2011
13 years 2 months ago
2011
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...
AML
2011
13 years 2 months ago
2011
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
EJC
2002
13 years 7 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...