scientific article; zbMATH DE number 3540832
From MaRDI portal
Publication:4116466
zbMath0347.05116MaRDI QIDQ4116466
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Problem books (00A07) Coloring of graphs and hypergraphs (05C15)
Related Items (20)
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ A (5,5)-Colouring of Kn with Few Colours ⋮ Some recent results on Ramsey-type numbers ⋮ A note on long cycles in sparse random graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Finding Folkman Numbers via MAX CUT Problem ⋮ Edge-colouring graphs with local list sizes ⋮ Some remarks on vertex Folkman numbers for hypergraphs ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ On forbidden subdivision characterizations of graph classes ⋮ Induced Ramsey-type theorems ⋮ A scaling limit for the length of the longest cycle in a sparse random graph ⋮ Partitions of finite relational and set systems ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) ⋮ Progress on local properties problems of difference sets ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
This page was built for publication:
