Hypergraphs with many Kneser colorings

This publication has 16 references indexed in Scilit:

• On Colourings of Hypergraphs Without Monochromatic Fano Planes
  Combinatorics, Probability and Computing, 2009
• The typical structure of graphs without given excluded subgraphs
  Random Structures & Algorithms, 2008
• The Turán Number Of The Fano Plane
  Combinatorica, 2005
• Triple Systems Not Containing a Fano Configuration
  Combinatorics, Probability and Computing, 2005
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
  Journal of the London Mathematical Society, 2004
• The number of graphs without forbidden subgraphs
  Journal of Combinatorial Theory, Series B, 2004
• The Complete Intersection Theorem for Systems of Finite Sets
  European Journal of Combinatorics, 1997
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
  Graphs and Combinatorics, 1986
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
  Bulletin of the American Mathematical Society, 1985
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
  The Quarterly Journal of Mathematics, 1961