Some remarks on simple tournaments
From MaRDI portal
Publication:2562867
DOI10.1007/BF02945032zbMath0267.05104OpenAlexW1974845500WikidataQ105478702 ScholiaQ105478702MaRDI QIDQ2562867
Paul Erdős, Eric C. Milner, Ervin Fried, Andras Hajnal
Publication date: 1972
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02945032
Related Items (35)
On the \(P_3\)-hull number of some products of graphs ⋮ Algorithmic and structural aspects of the \(P_3\)-Radon number ⋮ Decomposability and co-modular indices of tournaments ⋮ Decomposability index of tournaments ⋮ Inapproximability results and bounds for the Helly and Radon numbers of a graph ⋮ The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results ⋮ On the Carathéodory number of interval and graph convexities ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ The maximum time of 2-neighbor bootstrap percolation: complexity results ⋮ Target set selection with maximum activation time ⋮ On two-path convexity in multipartite tournaments ⋮ Characterization and recognition of Radon-independent sets in split graphs ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament ⋮ The convexity of induced paths of order three and applications: complexity aspects ⋮ An upper bound on the \(P_3\)-Radon number ⋮ On the contour of graphs ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ The simplicity index of tournaments ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ Inapproximability results for graph convexity parameters ⋮ Prime orientable graphs ⋮ Simple tournaments and sharply transitive groups ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ Unnamed Item ⋮ Either tournaments or algebras? ⋮ Partitioning a graph into convex sets ⋮ Radon numbers for trees ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Making a tournament indecomposable by one subtournament-reversal operation ⋮ SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES ⋮ Embedding tournaments in simple tournaments ⋮ On the Convexity of Paths of Length Two in Undirected Graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
Cites Work
This page was built for publication: Some remarks on simple tournaments
