BibTeX
@MISC{Pikhurko00weaklysaturated,
author = {Oleg Pikhurko},
title = {Weakly Saturated Hypergraphs and Exterior Algebra},
year = {2000}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
... Our main technique G-proof, developed from ideas of Kalai, is based on matroids derived from exterior algebra. We prove that if some graphs admit G-proof then so do `cones' and `joins' of such graphs, so that the w-satfunction can be computed for many graphs that are built up from certain elementary graphs by these operations.
Citations
| 1493 | Random Graphs - BOLLOBAS - 2001 |
| 49 | Finite dimensional multilinear algebra, Parts I and - Marcus - 1973 |
| 23 | An extremal problem for two families of sets - Frankl - 1982 |
| 17 | Flats in matroids and geometric graphs - Lovász - 1977 |
| 10 | Saturated graphs with minimal number of edges - K'aszonyi, Tuza - 1986 |
| 8 | Symmetric matroids - Kalai - 1990 |
| 7 | An extremal problem for sets with applications to graph theory - Alon |
| 7 | An interrelation between line graphs, eigenvalues and matroids - Doob - 1973 |
| 7 | Hyperconnectivity of graphs - Kalai - 1985 |
| 6 | The minimum size of saturated hypergraphs - Pikhurko - 1999 |
| 4 | Saturated r-uniform hypergraphs - Erdos, Furedi, et al. - 1991 |
| 4 | Extremal problems on saturated graphs and hypergraphs, Ars Combinatoria 25B - Tuza - 1988 |
| 4 | Hyperconnectivity of graphs, Graphs combin - Kalai - 1985 |
| 2 | Weakly k-saturated graphs - Bollob'as - 1967 |
| 2 | Uniform families and count matroids - Pikhurko - 1998 |
| 2 | An extremal problem for sets: A new approach via Bezoutians - Yu - 1993 |
