193 search results - page 1 / 39 » The structure of almost all graphs in a hereditary property |
JCT
2011
12 years 11 months ago
2011
ECCC
2007
13 years 4 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
FUIN
2010
13 years 2 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
SIAMDM
1998
13 years 4 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...