scientific article; zbMATH DE number 1317271

MaRDI QIDQ4256582zbMATH OpenFDO

Authors Fan Chung, Ron Graham

Publication date 25 July 1999

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 1131467
• Open problems of Paul Erd�s in graph theory
• Erdős work on infinite graphs
• scientific article; zbMATH DE number 3877298
• scientific article; zbMATH DE number 3349865
• scientific article; zbMATH DE number 3212735
• scientific article; zbMATH DE number 1943958
• Adjacency properties of graphs and a conjecture of Erdős
• On a problem of Erdős and Graham

Cited in

(19)

• The triangle-free process
• New upper bound for multicolor Ramsey number of odd cycles
• \(p\)-arrangeable graphs are Folkman linear
• An irrational Turán density via hypergraph Lagrangian densities
• Non-jumping Turán densities of hypergraphs
• A path Turán problem for infinite graphs
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• A Folkman linear family
• Ramsey numbers of \(K_3\) and \(K_{n,n}\)
• An irrational Lagrangian density of a single hypergraph
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Lagrangian-perfect hypergraphs
• Ramsey numbers for multiple copies of sparse graphs
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• Trimming forests is hard (unless they are made of stars)
• Colorings of k-sets with low discrepancy on small sets
• Bollobás-Erdős-Tuza conjecture for graphs with no induced \(K_{s , t}\)
• Piercing independent sets in graphs without large induced matching
• Sublinear hitting sets for some geometric graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256582)