scientific article; zbMATH DE number 3880754

MaRDI QIDQ3346362zbMATH OpenFDO

Authors Arie Bialostocki

Publication date 1983

zbMATH Keywords

2-colorings of the n cubemonochromatic subgraph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• On the maximum number of edges in a c₄‐free subgraph of q_n
• 28 R(C₄,C₄,C₃,C₃) 36
• Ramsey numbers of cubes versus cliques
• Subgraphs of a hypercube containing no small even cycles
• A note on short cycles in a hypercube

Cited in

(15)

• Some Turán type results on the hypercube
• Coloring the cube with rainbow cycles
• The polychromatic number of small subsets of the integers modulo \(n\)
• Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs
• Cube Ramsey numbers are polynomial
• Vertex Ramsey problems in the hypercube
• A Ramsey-type result for the hypercube
• A remark on rainbow 6-cycles in hypercubes
• On the Ramsey number of the triangle and the cube
• Turán’s Theorem in the Hypercube
• On balanced colorings of the \(n\)-cube
• The size‐Ramsey number of cubic graphs
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
• Sensitivity conjecture and signed hypercubes
• Some Ramsey-type results for the n-cube

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 Q3346362)