41 research outputs found
Erdos-Hajnal-type theorems in hypergraphs
The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free,
that is, it does not contain an induced copy of a given graph H, then it must
contain either a clique or an independent set of size n^{d(H)}, where d(H) > 0
depends only on the graph H. Except for a few special cases, this conjecture
remains wide open. However, it is known that a H-free graph must contain a
complete or empty bipartite graph with parts of polynomial size. We prove an
analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform
hypergraph on n vertices is H-free, for any given H, then it must contain a
complete or empty tripartite subgraph with parts of order c(log n)^{1/2 +
d(H)}, where d(H) > 0 depends only on H. This improves on the bound of c(log
n)^{1/2}, which holds in all 3-uniform hypergraphs, and, up to the value of the
constant d(H), is best possible. We also prove that, for k > 3, no analogue of
the standard Erdos-Hajnal conjecture can hold in k-uniform hypergraphs. That
is, there are k-uniform hypergraphs H and sequences of H-free hypergraphs which
do not contain cliques or independent sets of size appreciably larger than one
would normally expect.Comment: 15 page
Hipergráfok = Hypergraphs
A projekt cĂ©lkitűzĂ©seit sikerĂĽlt megvalĂłsĂtani. A nĂ©gy Ă©v során több mint száz kiválĂł eredmĂ©ny szĂĽletett, amibĹ‘l eddig 84 dolgozat jelent meg a tĂ©ma legkiválĂłbb folyĂłirataiban, mint Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, stb. Számos rĂ©gĂłta fennállĂł sejtĂ©st bebizonyĂtottunk, egĂ©sz rĂ©gi nyitott problĂ©mát megoldottunk hipergráfokkal kapcsolatban illetve kapcsolĂłdĂł terĂĽleteken. A problĂ©mák nĂ©melyike sok Ă©ve, olykor több Ă©vtizede nyitott volt. Nem egy közvetlen kutatási eredmĂ©ny, de szintĂ©n bizonyos Ă©rtĂ©kmĂ©rĹ‘, hogy a rĂ©sztvevĹ‘k egyike a NorvĂ©g Királyi AkadĂ©mia tagja lett Ă©s elnyerte a Steele dĂjat. | We managed to reach the goals of the project. We achieved more than one hundred excellent results, 84 of them appeared already in the most prestigious journals of the subject, like Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, etc. We proved several long standing conjectures, solved quite old open problems in the area of hypergraphs and related subjects. Some of the problems were open for many years, sometimes for decades. It is not a direct research result but kind of an evaluation too that a member of the team became a member of the Norvegian Royal Academy and won Steele Prize
Turán-Ramsey theorems and simple asymptotically extremal structures
This paper is a continuation of [10], where P. Erdos, A. Hajnal, V. T. Sos. and E. Szemeredi investigated the following problem:
Assume that a so called forbidden graph L and a function f(n) = o(n) are fixed. What is the maximum number of edges a graph G(n) on n vertices can have without containing L as a subgraph, and also without having more than f(n) independent vertices?
This problem is motivated by the classical Turan and Ramsey theorems, and also by some applications of the Turin theorem to geometry, analysis (in particular, potential theory) [27 29], [11-13].
In this paper we are primarily interested in the following problem. Let (G(n)) be a graph sequence where G(n) has n vertices and the edges of G(n) are coloured by the colours chi1,...,chi(r), so that the subgraph of colour chi(nu) contains no complete subgraph K(pnu), (nu = 1,...,r). Further, assume that the size of any independent set in G(n) is o(n) (as n --> infinity). What is the maximum number of edges in G(n) under these conditions?
One of the main results of this paper is the description of a procedure yielding relatively simple sequences of asymptotically extremal graphs for the problem. In a continuation of this paper we shall investigate the problem where instead of alpha(G(n)) = o(n) we assume the stronger condition that the maximum size of a K(p)-free induced subgraph of G(n) is o(n)