Pages that link to "Item:Q4255807"
From MaRDI portal
The following pages link to Constructive Quasi-Ramsey Numbers and Tournament Ranking (Q4255807):
Displaying 16 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Almost given length cycles in digraphs (Q2482351) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Packing Triangles in Regular Tournaments (Q2852611) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- On characterizing hypergraph regularity (Q4798170) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- An improved MST algorithm for ranking players of a round-robin tournament (Q5438689) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)
- Partitioning problems in dense hypergraphs (Q5957354) (← links)
- Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
