Tag Archives: null subgraph

EKR, Steiner systems, association schemes, and all that

A great number of mathematical problems amount to looking in a large but highly structured graph, and finding a complete or null subgraph of largest possible size there. For a simple example, consider Latin squares of order n. One of … Continue reading

Posted in exposition | Tagged , , , , , , | Leave a comment