The number of edge colorings with no monochromatic triangle
نویسنده
چکیده
Let F (n, k) denote the maximum number of two edge colorings of a graph on n vertices that admit no monochromatic Kk, (a complete graph on k vertices). The following results are proved: F (n, 3) = 2bn /4c for all n ≥ 6. F (n, k) = 2 k−2 2k−2+o(1))n 2 . In particular, the first result solves a conjecture of Erdös and Rothschild.
منابع مشابه
Gallai colorings of non-complete graphs
Gallai-colorings of complete graphs – edge colorings such that no triangle is colored with three distinct colors – occur in various contexts such as the theory of partially ordered sets (in Gallai’s original paper), information theory and the theory of perfect graphs. We extend here Gallai-colorings to non-complete graphs and study the analogue of a basic result – any Gallai-colored complete gr...
متن کاملEdge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H , let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic to H . These two numbers generalize the classical anti-Ramsey and Ramsey numbers, respectively. ...
متن کاملRamsey-type results for Gallai colorings
A Gallai-coloring (G-coloring) is a generalization of 2-colorings of edges of complete graphs: a G-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Here we extend some results known earlier for 2-colorings to G-colorings. We prove that in every G-coloring of Kn there exists each of the following: 1. a monochromatic double star with at...
متن کاملHypergraphs with many Kneser colorings
For fixed positive integers r, k and ` with 1 ≤ ` < r and an r-uniform hypergraph H, let κ(H, k, `) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least ` elements. Consider the function KC(n, r, k, `) = maxH∈Hn κ(H, k, `), where the maximum runs over the family Hn of all r-uniform hypergraphs on n vertices. In...
متن کاملRamsey numbers in rainbow triangle free colorings
Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n vertices contains either a three colored triangle or a monochromatic copy of the graph G. This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 21 شماره
صفحات -
تاریخ انتشار 1996