The following pages link to (Q5509547):
Displaying 50 items.
- Uniquely tree-saturated graphs (Q292245) (← links)
- On high-dimensional acyclic tournaments (Q393743) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- Incoherent majorities: the McGarvey problem in judgement aggregation (Q642973) (← links)
- Efron's coins and the linial arrangement (Q738854) (← links)
- Majority decisions when abstention is possible (Q764902) (← links)
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- Simple games with many effective voters (Q844903) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Unavoidable patterns (Q958758) (← links)
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- On the learnability of majority rule (Q996375) (← links)
- What majority decisions are possible (Q1025491) (← links)
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure (Q1175774) (← links)
- Combinatorial problems on the existence of large submatrices. I (Q1237735) (← links)
- On \(\lambda\)-majority voting paradoxes (Q1296508) (← links)
- A short proof of a theorem of Reid and Parker on tournaments (Q1343229) (← links)
- On tournaments and their largest transitive subtournaments (Q1343231) (← links)
- The 3 and 4-dichromatic tournaments of minimum order (Q1343264) (← links)
- On a problem of Erdős and Rado (Q1387613) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- Some Ramsey nu mbers for directed graphs (Q1846431) (← links)
- Voting paradoxes and digraphs realizations (Q1865256) (← links)
- Upper bounds on the size of transitive subtournaments in digraphs (Q2013188) (← links)
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth (Q2094884) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- An almost optimal bound on the number of intersections of two simple polygons (Q2105320) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- Subdivisions of digraphs in tournaments (Q2221927) (← links)
- New bounds on the Ramsey number \(r ( I_m , L_n )\) (Q2222964) (← links)
- On the restricted isometry property of the Paley matrix (Q2238859) (← links)
- On unimodular tournaments (Q2244871) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Idiosynchromatic poetry (Q2341927) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- A counterexample to a conjecture of Schwartz (Q2452120) (← links)
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) (Q2490871) (← links)
- Internal coverings of sets by asymmetric relations (Q2554697) (← links)
- Extremal problems for directed graphs (Q2557710) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Eternal dominating sets on digraphs and orientations of graphs (Q2659065) (← links)
- On the abstract chromatic number and its computability for finitely axiomatizable theories (Q2668017) (← links)
- Tighter bounds on directed Ramsey number \(R(7)\) (Q2676760) (← links)
- The nonmanipulative vote-deficits of voting rules (Q2695443) (← links)
