On generalized Ramsey numbers for trees

DOI10.1007/BF02579372zbMATH Open0572.05045MaRDI QIDQ1062076FDOQ1062076

Authors: Albrecht Brandis, Jürgen Bierbrauer 

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• An upper bound on the Ramsey number of trees
• scientific article; zbMATH DE number 2197938
• Monochromatic coverings and tree Ramsey numbers
• scientific article; zbMATH DE number 786146
• scientific article; zbMATH DE number 4099362

zbMATH Keywords

treeLatin squaresRamsey numberresolvable block designs

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Generalized Ramsey theory (05C55)

Cites Work

• The blocking number of an affine space
• Title not available (Why is that?)
• Orthomorphisms of Groups and Orthogonal Latin Squares. I
• Generalised Ramsey numbers for small graphs
• Title not available (Why is that?)
• On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I
• Undecided Ramsey-numbers for paths
• Disjoint Subquasigroups

Cited In (27)

• Local and mean Ramsey numbers for trees
• Title not available (Why is that?)
• On some Multicolor Ramsey Properties of Random Graphs
• Title not available (Why is that?)
• Degree Ramsey numbers of closed blowups of trees
• Upper bounds for a Ramsey theorem for trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• An upper bound on the Ramsey number of trees
• Ramsey Numbers for Connected 2-Colorings of Complete Graphs
• Title not available (Why is that?)
• Ramsey problems and their connection to tuŕan-type extremal problems
• Title not available (Why is that?)
• Highly connected monochromatic subgraphs
• Monochromatic coverings and tree Ramsey numbers
• Matchings and covers in hypergraphs
• Covering \(t\)-element sets by partitions
• Title not available (Why is that?)
• Ramsey numbers for the path with three edges
• On the Ramsey number of trees versus graphs with large clique number
• Covering the complete graph by partitions
• Size of monochromatic components in local edge colorings
• Monochromatic partitions in local edge colorings
• Weighted arcs, the finite Radon transform and a Ramsey problem
• More on monochromatic-rainbow Ramsey type theorems
• Directed Ramsey number for trees
• Title not available (Why is that?)

This page was built for publication: On generalized Ramsey numbers for trees

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