Hypergraphs with many Kneser colorings

Authors:
Carlos Hoppen;Yoshiharu Kohayakawa;Hanno Lefmann
Affiliations:
Instituto de Matemática, UFRGS-Avenida Bento Gonçalves, 9500, 91501-970 Porto Alegre, RS, Brazil;Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão, 1010, CEP 05508-090, São Paulo, Brazil;Fakultät für Informatik, Technische Universität Chemnitz, Strasse der Nationen 62, D-09107 Chemnitz, Germany
Venue:
European Journal of Combinatorics
Year:
2012

Citing 8
Cited 2

The number of edge colorings with no monochromatic triangle

Journal of Graph Theory
The complete intersection theorem for systems of finite sets

European Journal of Combinatorics
The number of graphs without forbidden subgraphs

Journal of Combinatorial Theory Series B
Triple Systems Not Containing a Fano Configuration

Combinatorics, Probability and Computing
The Turán Number Of The Fano Plane

Combinatorica
The typical structure of graphs without given excluded subgraphs

Random Structures & Algorithms
On colourings of hypergraphs without monochromatic fano planes

Combinatorics, Probability and Computing
Edge colourings of graphs avoiding monochromatic matchings of a given size

Combinatorics, Probability and Computing

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number

European Journal of Combinatorics
An unstable hypergraph problem with a unique optimal solution

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For fixed positive integers r,k and @? with 1@?@?