On generalized Ramsey numbers for trees

DOI10.1007/BF02579372zbMath0572.05045MaRDI QIDQ1062076

Albrecht Brandis, Juergen Bierbrauer

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

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)

Related Items (11)

Ramsey numbers for the path with three edges ⋮ Unnamed Item ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Size of monochromatic components in local edge colorings ⋮ Covering the complete graph by partitions ⋮ Monochromatic partitions in local edge colorings ⋮ Weighted arcs, the finite Radon transform and a Ramsey problem ⋮ Covering \(t\)-element sets by partitions ⋮ Highly connected monochromatic subgraphs ⋮ Matchings and covers in hypergraphs ⋮ Monochromatic coverings and tree Ramsey numbers

Cites Work

• Unnamed Item
• Unnamed Item
• The blocking number of an affine space
• Undecided Ramsey-numbers for paths
• Generalised Ramsey numbers for small graphs
• On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I
• Orthomorphisms of Groups and Orthogonal Latin Squares. I
• Disjoint Subquasigroups

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