Abstract
P. Erdős and A. Hajnal asked the following question. Does there exist a constant ε>0 with the following property: If every subgraphH of a graphG can be made bipartite by the omission of at most ε|H| edges where |H| denotes the number of vertices ofH thenx(H) ≦ 3.
The aim of this note is to give a negative answer to this question and consider the analogous problem for hypergraphs. The first was done also by L. Lovász who used a different construction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Bárány, A short proof of Kneser’s conjecture,Journal of Comb. Theory, A,25 (1978), 325–326.
B. Bollobás,Extremal graph theory, Academic Press, London 1978.
P. Erdős, Graph theory and probability,Canadian J. of Math. 11 (1959), 34–38.
P. Erdős, On the combinatorial problems which I would most like to see solved,Combinatorica 1 (1981), 25–42.
P. Erdős andA. Hajnal, Kromatikus gráfokról (On chromatic graphs, in Hungarian),Matematikai Lapok 18 (1967), 1–4.
P. Erdős, A. Hajnal andE. Szemerédi, On almost bipartite large chromatic graphs,to appear in the volume dedicated to the 60th birthday of A. Kotzig.
D. Greenwell andL. Lovász, Applications of product colouring,Acta Math. Acad. Sci. Hung. 25 (1974), 335–340.
L. Lovász, Kneser’s conjecture, chromatic number, and homotopy,J. Combinatorial Theory, A,25 (1978), 319–324.
L. Lovász,Combinatorial Problems and Exercises, Akadémiai Kiadó — North-Holland, Budapest—Amsterdam, 1979.
V. Rödl andZs. Tuza, On color critical graphs (manuscript).
A. Schrijver, Vertex-critical subgraphs of Kneser graphs,reprint, Amsterdam (1978).