scientific article; zbMATH DE number 3221981
From MaRDI portal
Publication:5509547
Recommendations
- scientific article; zbMATH DE number 15252
- Bounds on the spectral radius of graphs with e edges
- On the rank of a matrix associated with a graph.
- Transitive Orientations of Graphs
- On graphs of minimum skew rank 4
- Colorings and orientations of matrices and graphs
- Which graphs are determined by their spectrum?
- The structure matrix of the class of r-multigraphs with a prescribed degree sequence
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- An upper bound for the minimum rank of a graph
Cited in
(90)- What majority decisions are possible
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure
- Combinatorial problems on the existence of large submatrices. I
- On -majority voting paradoxes
- A short proof of a theorem of Reid and Parker on tournaments
- On tournaments and their largest transitive subtournaments
- The 3 and 4-dichromatic tournaments of minimum order
- On a problem of Erdős and Rado
- Single-machine scheduling with supporting tasks
- Some Ramsey nu mbers for directed graphs
- Voting paradoxes and digraphs realizations
- Upper bounds on the size of transitive subtournaments in digraphs
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
- Tight bounds for powers of Hamilton cycles in tournaments
- An almost optimal bound on the number of intersections of two simple polygons
- On the dichromatic number of surfaces
- On the local structure of oriented graphs -- a case study in flag algebras
- Paths with many shortcuts in tournaments
- Subdivisions of digraphs in tournaments
- New bounds on the Ramsey number r ( I_m , L_n )
- On the restricted isometry property of the Paley matrix
- On unimodular tournaments
- Subdivisions in digraphs of large out-degree or large dichromatic number
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Idiosynchromatic poetry
- Coloring the edges of a directed graph
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- Extremal k-forcing sets in oriented graphs
- A counterexample to a conjecture of Schwartz
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- Internal coverings of sets by asymmetric relations
- Extremal problems for directed graphs
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Eternal dominating sets on digraphs and orientations of graphs
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- Tighter bounds on directed Ramsey number \(R(7)\)
- Constructing order type graphs using an axiomatic approach
- The nonmanipulative vote-deficits of voting rules
- Uniquely tree-saturated graphs
- Tournaments and Semicomplete Digraphs
- Discrete Mathematics in Voting and Group Choice
- scientific article; zbMATH DE number 4091537 (Why is no real title available?)
- On high-dimensional acyclic tournaments
- Coloring the nodes of a directed graph
- On the perfect orderability of unions of two graphs
- Sets whose differences avoid squares modulo m
- Orientation Ramsey thresholds for cycles and cliques
- Turán theorems for unavoidable patterns
- Minimal Representations of Order Types by Geometric Graphs
- scientific article; zbMATH DE number 7300319 (Why is no real title available?)
- Voting procedures, complexity of
- Semidefinite programming and Ramsey numbers
- A tournament approach to pattern avoiding matrices
- Large unavoidable subtournaments
- Transitive tournament tilings in oriented graphs with large minimum total degree
- Graph theory
- Ranking graphs through hitting times of Markov chains
- The smallest 5-chromatic tournament
- Antidirected spanning closed trail in tournaments
- Construction of voting situations concordant with ranking patterns
- Construction of aggregation paradoxes through load-sharing models
- Incoherent majorities: the McGarvey problem in judgement aggregation
- On the classification of skew Hadamard matrices of order 36 and related structures
- Ramsey numbers of sparse digraphs
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Turán problems for oriented graphs
- On interval colouring reorientation number of oriented graphs
- Coloring tournaments with few colors: algorithms and complexity
- Directed graphs with lower orientation Ramsey thresholds
- Forbidden tournaments and the orientation completion problem
- A note between transitive C₄-factor and oriented Ramsey number
- Voting profiles admitting all candidates as knockout winners
- Antidirected Hamilton cycles in k-hypertournaments
- Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
- Colouring complete multipartite and Kneser-type digraphs
- A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄ (extended abstract)
- Conservation of Ramsey's theorem for pairs and well-foundedness
- Condorcet domains on at most seven alternatives
- Rank aggregation using scoring rules
- Blow-ups and extensions of trees in tournaments
- Efron's coins and the linial arrangement
- Majority decisions when abstention is possible
- Largest digraphs contained in all n-tournaments
- Decomposing oriented graphs into transitive tournaments
- Simple games with many effective voters
- Unavoidable tournaments
- Unavoidable patterns
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments
- On the learnability of majority rule
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 Q5509547)
