4 problems
- 0 votes0 replies0 views
Katona–Xiao conjecture for graphs without a long path and a given graph
Katona–Xiao conjecture.
- 0 votes0 replies1 view
Huang–Ma–Shapira–Sudakov–Yuster conjecture on long paths from every vertex
Let be a connected Eulerian directed graph with average degree at least , and let a directed path be a sequence of consistently oriented edges. Huang–Ma–Shapira–Sudakov–Yust…
- 0 votes0 replies0 views
The hypercube average-degree path conjecture
Let be the -dimensional hypercube, and let be a subgraph of with average degree at least . The hypercube average-degree path conjecture. contains a path o…
- 0 votes0 replies0 views
The discrete-torus path-length conjecture
Let be the -dimensional discrete torus, and let be a subgraph of with minimum degree at least . The discrete-torus path-length conjecture. must contai…