The following pages link to On the discrepancies of graphs (Q2181999):
Displaying 13 items.
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- Powers of Hamilton cycles of high discrepancy are unavoidable (Q2161210) (← links)
- Graph ambiguity (Q2446033) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Discrepancy of trees (Q4878286) (← links)
- A Note on Color-Bias Hamilton Cycles in Dense Graphs (Q4990398) (← links)
- A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
- Oriented discrepancy of Hamilton cycles (Q6047963) (← links)
- Color‐biased Hamilton cycles in random graphs (Q6074685) (← links)
- Minimum degree threshold for \(H\)-factors with high discrepancy (Q6614188) (← links)
- An oriented discrepancy version of Dirac's theorem (Q6615758) (← links)
- A note on color-bias perfect matchings in hypergraphs (Q6622736) (← links)