Long pages

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

1. (hist) ‎Blog:Tidbits/Bonn, matroids, and Farkas’ Lemma ‎[14,308 bytes]
2. (hist) ‎Edge-connectivity ‎[13,369 bytes]
3. (hist) ‎Packing common bases ‎[12,099 bytes]
4. (hist) ‎Blog:Tidbits/Generalized Nash Equilibrium ‎[11,681 bytes]
5. (hist) ‎Sub- and supermodular functions ‎[10,730 bytes]
6. (hist) ‎Blog:Tidbits/Kernel-perfectness ‎[7,628 bytes]
7. (hist) ‎Chip-firing ‎[7,455 bytes]
8. (hist) ‎Help:Wikilog styling ‎[7,337 bytes]
9. (hist) ‎Trees and branchings ‎[7,200 bytes]
10. (hist) ‎Matrices with indeterminates ‎[7,079 bytes]
11. (hist) ‎Maximum square-free 2-matching ‎[7,002 bytes]
12. (hist) ‎Woodall's conjecture ‎[6,733 bytes]
13. (hist) ‎Help:Special:Wikilog ‎[6,559 bytes]
14. (hist) ‎Stable matchings and kernels ‎[6,424 bytes]
15. (hist) ‎Help:Writing a wikilog article ‎[6,121 bytes]
16. (hist) ‎Finding kernels in special digraphs ‎[5,973 bytes]
17. (hist) ‎Integer polyhedra ‎[5,517 bytes]
18. (hist) ‎Kriesell's conjecture ‎[5,323 bytes]
19. (hist) ‎Help:Embedding wikilogs ‎[5,137 bytes]
20. (hist) ‎Talk:Capacitated packing of k-arborescences ‎[5,043 bytes]
21. (hist) ‎Orientations ‎[5,002 bytes]
22. (hist) ‎Graphs extendable to a uniquely matchable bipartite graph ‎[4,951 bytes]
23. (hist) ‎Independent trees ‎[4,632 bytes]
24. (hist) ‎Help:Wikilog settings ‎[4,403 bytes]
25. (hist) ‎Characterization of graphs having a k-connected orientation ‎[4,394 bytes]
26. (hist) ‎Generalized polymatroid ‎[4,340 bytes]
27. (hist) ‎Rigidity ‎[4,322 bytes]
28. (hist) ‎Rainbow matchings in bipartite graphs ‎[4,302 bytes]
29. (hist) ‎Matroids ‎[4,290 bytes]
30. (hist) ‎Stable matching ‎[4,288 bytes]
31. (hist) ‎Local edge-connectivity ‎[4,220 bytes]
32. (hist) ‎Berge's conjecture on path partitions ‎[4,129 bytes]
33. (hist) ‎Polyhedral description of kernels ‎[4,082 bytes]
34. (hist) ‎Stable flow ‎[4,022 bytes]
35. (hist) ‎Decomposition into forests and a bounded-degree subgraph ‎[4,004 bytes]
36. (hist) ‎Finding the largest popular matching in a bipartite graph ‎[3,957 bytes]
37. (hist) ‎Minimum k-way cut in a hypergraph ‎[3,928 bytes]
38. (hist) ‎Cyclic stable matchings ‎[3,873 bytes]
39. (hist) ‎Goddyn's conjecture on thin spanning trees ‎[3,867 bytes]
40. (hist) ‎Capacitated packing of k-arborescences ‎[3,688 bytes]
41. (hist) ‎Frank-Jordán theorem ‎[3,659 bytes]
42. (hist) ‎Exact matching in red-blue bipartite graphs ‎[3,653 bytes]
43. (hist) ‎Deciding the existence of popular matchings ‎[3,606 bytes]
44. (hist) ‎Orientation with shortest round trip ‎[3,592 bytes]
45. (hist) ‎Matroid matching ‎[3,431 bytes]
46. (hist) ‎Rigid graph ‎[3,353 bytes]
47. (hist) ‎Skew-supermodular colouring with prescribed class-sizes ‎[3,316 bytes]
48. (hist) ‎Colouring ‎[3,285 bytes]
49. (hist) ‎Even factor problem ‎[3,279 bytes]
50. (hist) ‎Partition median problem ‎[3,214 bytes]

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)