Most linked-to pages

Jump to: navigation, search

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

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

  1. User:Tkiraly‏‎ (26 links)
  2. Supermodular function‏‎ (17 links)
  3. Arborescence‏‎ (14 links)
  4. Help:Wikilog‏‎ (12 links)
  5. Rigid graph‏‎ (10 links)
  6. User talk:Tkiraly‏‎ (10 links)
  7. Help:Wikilog settings‏‎ (9 links)
  8. Help:Wikilog styling‏‎ (9 links)
  9. Help:Writing a wikilog article‏‎ (9 links)
  10. Stable matching‏‎ (9 links)
  11. Submodular function‏‎ (9 links)
  12. Help:Embedding wikilogs‏‎ (9 links)
  13. Help:Overview of wikilog articles‏‎ (9 links)
  14. Help:Overview of wikilogs‏‎ (9 links)
  15. Help:Special:Wikilog‏‎ (9 links)
  16. Capacitated packing of k-arborescences‏‎ (8 links)
  17. Edmonds' disjoint arborescences theorem‏‎ (8 links)
  18. Kernel (in digraph)‏‎ (8 links)
  19. Partition connectivity‏‎ (7 links)
  20. Base orderable matroid‏‎ (7 links)
  21. Chip-firing‏‎ (7 links)
  22. Rigidity matrix‏‎ (7 links)
  23. Total dual integrality‏‎ (7 links)
  24. Count matroid‏‎ (6 links)
  25. Base polyhedron‏‎ (6 links)
  26. Integer decomposition property‏‎ (6 links)
  27. Generalized polymatroid‏‎ (6 links)
  28. Clutter‏‎ (6 links)
  29. Galvin's bipartite list-edge-colouring theorem‏‎ (6 links)
  30. Chromatic number‏‎ (6 links)
  31. Local edge-connectivity‏‎ (5 links)
  32. Capacity-obeying packing‏‎ (5 links)
  33. Highly element-connected orientation‏‎ (5 links)
  34. Destroying rigidity‏‎ (5 links)
  35. Supermodular colouring theorem‏‎ (5 links)
  36. Generic rigidity in three dimensions‏‎ (5 links)
  37. User:Veghal‏‎ (5 links)
  38. Matroid matching‏‎ (5 links)
  39. Tutte's disjoint tree theorem‏‎ (5 links)
  40. Characterization of graphs having a k-connected orientation‏‎ (5 links)
  41. T-perfect and h-perfect graphs‏‎ (5 links)
  42. Packing common bases‏‎ (5 links)
  43. Nash-Williams' strong orientation theorem‏‎ (5 links)
  44. Linear equivalence of graph divisors‏‎ (5 links)
  45. Polyhedral description of kernels‏‎ (4 links)
  46. Exact matching in red-blue bipartite graphs‏‎ (4 links)
  47. Hypergraphic matroid‏‎ (4 links)
  48. Dijoin‏‎ (4 links)
  49. Finding kernels in special digraphs‏‎ (4 links)
  50. Disjoint spanning in- and out-arborescences‏‎ (4 links)

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