On Ramsey-Turán type problems in tournaments

DOI10.1016/0012-365X(86)90168-8zbMATH Open0586.05022MaRDI QIDQ1071781FDOQ1071781

Arie Bialostocki, Norbert Sauer

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tournamentedge-colourings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On monochromatic paths in edge-coloured digraphs
• A Ramsey-type problem in directed and bipartite graphs
• Optimal ranking of tournaments

Cited In (7)

• The shifted Turán sieve method on tournaments. II
• A combinatorial property of the maximum round robin tournament problem
• Reachability problems in edge-colored digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An application of the Ramsey theorem to ordered r-tournaments

This page was built for publication: On Ramsey-Turán type problems in tournaments

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