Bounded symmetric difference for -free bipartite graphs
Let be a graph in the class of -free bipartite graphs. The bounded symmetric-difference conjecture. The symmetric difference is bounded in the class of -free bipartite graphs. The boundedness of symmetric difference is open for this remaining class from the paper's speed dichotomy.
References
- Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim Lozin and Viktor Zamaraev, “Graph parameters, implicit representations and factorial properties”, arXiv:2303.04453 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.