TT_n-maximal digraphs of the minimum size

DOI10.1016/S0012-365X(99)00193-4zbMATH Open0941.05032OpenAlexW4212879182MaRDI QIDQ1970725FDOQ1970725

Irmina A. Zioło

Publication date: 30 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00193-4

zbMATH Keywords

tournamentextremal digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• Title not available (Why is that?) 👍 👎
• Digraphs that have at most one walk of a given length with the same endpoints 👍 👎
• A note on the degree-diameter problem for arc-transitive graphs 👍 👎
• Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints 👍 👎
• A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints 👍 👎
• Packing of two digraphs into a transitive tournament 👍 👎
• Some extremal properties concerning transitivity in graphs 👍 👎
• A note on a packing problem in transitive tournaments 👍 👎
• Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments 👍 👎
• On the capacity of digraphs 👍 👎

This page was built for publication: \(\text{TT}_n\)-maximal digraphs of the minimum size

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