scientific article; zbMATH DE number 3221981
From MaRDI portal
Publication:5509547
zbMath0136.44901MaRDI QIDQ5509547
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the dichromatic number of surfaces ⋮ Uniquely tree-saturated graphs ⋮ 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 ⋮ Simple games with many effective voters ⋮ Turán theorems for unavoidable patterns ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Eternal dominating sets on digraphs and orientations of graphs ⋮ On the local structure of oriented graphs -- a case study in flag algebras ⋮ On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ On a problem of Erdős and Rado ⋮ On high-dimensional acyclic tournaments ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Coloring the nodes of a directed graph ⋮ Tighter bounds on directed Ramsey number \(R(7)\) ⋮ 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 ⋮ Unavoidable tournaments ⋮ Construction of aggregation paradoxes through load-sharing models ⋮ Large Unavoidable Subtournaments ⋮ The nonmanipulative vote-deficits of voting rules ⋮ Incoherent majorities: the McGarvey problem in judgement aggregation ⋮ Paths with many shortcuts in tournaments ⋮ Subdivisions of digraphs in tournaments ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ A counterexample to a conjecture of Schwartz ⋮ Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure ⋮ Voting Procedures, Complexity of ⋮ On the restricted isometry property of the Paley matrix ⋮ On unimodular tournaments ⋮ Single-machine scheduling with supporting tasks ⋮ A tournament approach to pattern avoiding matrices ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Unavoidable patterns ⋮ Discrete Mathematics in Voting and Group Choice ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ Upper bounds on the size of transitive subtournaments in digraphs ⋮ Combinatorial problems on the existence of large submatrices. I ⋮ On the learnability of majority rule ⋮ Graph theory ⋮ Efron's coins and the linial arrangement ⋮ What majority decisions are possible ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Majority decisions when abstention is possible ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Internal coverings of sets by asymmetric relations ⋮ Extremal problems for directed graphs ⋮ Unnamed Item ⋮ On \(\lambda\)-majority voting paradoxes ⋮ Tournaments and Semicomplete Digraphs ⋮ Sets whose differences avoid squares modulo 𝑚 ⋮ Largest digraphs contained in all n-tournaments ⋮ Some Ramsey nu mbers for directed graphs ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth ⋮ Idiosynchromatic poetry ⋮ Orientation Ramsey Thresholds for Cycles and Cliques ⋮ Tight bounds for powers of Hamilton cycles in tournaments ⋮ An almost optimal bound on the number of intersections of two simple polygons ⋮ Voting paradoxes and digraphs realizations ⋮ Coloring the edges of a directed graph ⋮ Decomposing oriented graphs into transitive tournaments
This page was built for publication:
