Search
Now showing items 1-3 of 3
A Paley-like graph in characteristic two
(Journal of Combinatorics, 2016)
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph ...
Simple Containers for Simple Hypergraphs
(Cambridge University PressCombinatorics Probability and Computing, 2016-05-01)
We give an easy method for constructing containers for simple hypergraphs. The method also has consequences for non-simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered ...
Hypergraph containers
(SpringerInventiones Mathematicae, 2015-01-08)
We develop a notion of containment for independent sets in hypergraphs. For every r-uniform hypergraph G, we find a relatively small collection C of vertex subsets, such that every independent set of G is contained within ...