scientific article; zbMATH DE number 1131467
From MaRDI portal
Publication:4382659
zbMath0890.05049MaRDI QIDQ4382659
Fan R. K. Chung, Ronald L. Graham
Publication date: 22 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items
On the maximum diameter of \(k\)-colorable graphs, Towards the 0-statement of the Kohayakawa-Kreuter conjecture, A variation of a classical Turán-type extremal problem, Packing tripods: narrowing the density gap, A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\), Objective functions with redundant domains, On colorful edge triples in edge-colored complete graphs, An improved bound for the stepping-up lemma, Some recent results on Ramsey-type numbers, The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\), Hypergraph Turán densities can have arbitrarily large algebraic degree, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Combinatorics. Abstracts from the workshop held January 1--7, 2023, The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs, Finding Folkman Numbers via MAX CUT Problem, Graph and hypergraph colouring via nibble methods: a survey, A bipartite version of the Erdős–McKay conjecture, A proof of the Erdős-Faber-Lovász conjecture, On Turán numbers for disconnected hypergraphs, How does the chromatic number of a random graph vary?, On Multicolor Ramsey Numbers of Triple System Paths of Length 3, Hitting all maximum stable sets in \(P_5\)-free graphs, The asymptotics of \(r(4,t)\), The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, On possible Turán densities, On a problem of Erdős and Rothschild on edges in triangles, Lovász, Vectors, Graphs and Codes, Non-concentration of the chromatic number of a random graph, Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza, On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs, Bipartite Ramsey numbers of \(K_{t,s}\) in many colors, Ramsey numbers of cubes versus cliques, A conjecture of Erdős on graph Ramsey numbers, Large almost monochromatic subsets in hypergraphs, On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property, Hypergraph Ramsey numbers, The chromatic gap and its extremes, On the multicolor Ramsey number of a graph with \(m\) edges, Induced subgraphs with many repeated degrees, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, Ramsey functions involving \(K_{m,n}\) with \(n\) large, On Some Open Questions for Ramsey and Folkman Numbers, Two Chromatic Conjectures: One for Vertices and One for Edges, Ramsey numbers involving an odd cycle and large complete graphs in three colors, An upper bound for the Turán number \(t_3(n,4)\), Norm-graphs: Variations and applications, Idiosynchromatic poetry, The Erdos-Szekeres problem on points in convex position – a survey, Upper bounds on probability thresholds for asymmetric Ramsey properties, On the algebraic and topological structure of the set of Turán densities
