Some remarks on simple tournaments
From MaRDI portal
Publication:2562867
DOI10.1007/BF02945032zbMATH Open0267.05104OpenAlexW1974845500WikidataQ105478702 ScholiaQ105478702MaRDI QIDQ2562867FDOQ2562867
Authors: Ervin Fried, Andras Hajnal, Eric C. Milner, P. Erdős 
Publication date: 1972
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02945032
Recommendations
- The simplicity index of tournaments
- Generalizations of tournaments: A survey
- scientific article; zbMATH DE number 4043867
- On the functional completeness of simple tournaments
- Publication:3496354
- A note on hypertournaments
- scientific article; zbMATH DE number 3916313
- On explicit random-like tournaments
- A note on handicap incomplete tournaments
- Simple one‐point extensions of tournaments
Cites Work
Cited In (45)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposability index of tournaments
- Irreducible pairings and indecomposable tournaments
- Homogeneous tournaments revisited
- On the Carathéodory number of interval and graph convexities
- On two-path convexity in multipartite tournaments
- The morphology of infinite tournaments; application to the growth of their profile
- Decomposability and co-modular indices of tournaments
- An upper bound on the \(P_3\)-Radon number
- Embedding tournaments in simple tournaments
- On the convexity of paths of length two in undirected graphs
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- Hull and geodetic numbers for some classes of oriented graphs
- Hull and geodetic numbers for some classes of oriented graphs
- On the \(P_3\)-hull number of some products of graphs
- Simple one‐point extensions of tournaments
- Prime orientable graphs
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
- Radon numbers for trees
- The simplicity index of tournaments
- Characterization and recognition of Radon-independent sets in split graphs
- Either tournaments or algebras?
- Simple extensions of combinatorial structures
- On the \(P_3\)-hull number of Hamming graphs
- A remark on the tournament game
- Making a tournament indecomposable by one subtournament-reversal operation
- On the contour of graphs
- Inapproximability results and bounds for the Helly and Radon numbers of a graph
- On the Carathéodory number for the convexity of paths of order three
- A surprising permanence of old motivations (a not-so-rigid story)
- On the functional completeness of simple tournaments
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Inapproximability results for graph convexity parameters
- The maximum time of 2-neighbor bootstrap percolation: complexity results
- Algorithmic and structural aspects of the \(P_3\)-Radon number
- Simple tournaments and sharply transitive groups
- Target set selection with maximum activation time
- The convexity of induced paths of order three and applications: complexity aspects
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning a graph into convex sets
This page was built for publication: Some remarks on simple tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562867)
