The following pages link to (Q5509547):
Displaying 25 items.
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Discrete Mathematics in Voting and Group Choice (Q3321780) (← links)
- On the perfect orderability of unions of two graphs (Q4944684) (← links)
- Sets whose differences avoid squares modulo 𝑚 (Q5002534) (← links)
- Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
- Turán theorems for unavoidable patterns (Q5063194) (← links)
- (Q5146078) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Semidefinite Programming and Ramsey Numbers (Q5163505) (← links)
- Large Unavoidable Subtournaments (Q5366934) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Graph theory (Q5917392) (← links)
- Ranking graphs through hitting times of Markov chains (Q6074655) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)
- Antidirected spanning closed trail in tournaments (Q6089579) (← links)
- Construction of voting situations concordant with ranking patterns (Q6098179) (← links)
- Construction of aggregation paradoxes through load-sharing models (Q6159384) (← links)
- On the classification of skew Hadamard matrices of order 36 and related structures (Q6618626) (← links)
- Ramsey numbers of sparse digraphs (Q6635126) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)
- Turán problems for oriented graphs (Q6644281) (← links)
- On interval colouring reorientation number of oriented graphs (Q6648249) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
- Directed graphs with lower orientation Ramsey thresholds (Q6658478) (← links)
- Forbidden tournaments and the orientation completion problem (Q6668354) (← links)
