13 problems
Let be the complete -uniform hypergraph on vertices, and let denote its saturation number on vertices. Saturation-number conjecture. For…
For a 3-uniform hypergraph, let denote the minimum number of hyperedges in a Berge--saturated hypergraph on vertices. Here a hypergrap…
Let be a graph, and let denote the saturation number for -uniform hypergraphs on vertices avoiding Berge-. Linear saturation conjec…
Let be a graph, let be a positive integer, and let denote the least number of edges in a Berge--saturated -uniform hypergraph on…
Let and . A -uniform hypergraph is an -hamiltonian saturated hypergraph if it is not -hamiltonian, but adding any new edge creates a…
Let be a -uniform hypergraph, and let a Berge copy of be a hypergraph for which and there is a bijection such that…
Let be a graph, and let a Berge copy of be a hypergraph for which and there is a bijection such that for every…
Higher-uniformity Berge saturation conjecture. For every and every -uniform hypergraph ,
Linearity conjecture. For every uniformity and every graph , the saturation number grows linearly in .
Pikhurko's conjecture. For every -graph , the limit
Let be fixed, and let be any fixed finite family of graphs. Write for the minimum number of edges in a -unif…
Let denote the minimum number of edges in a -uniform hypergraph on vertices that is Berge--saturated, and let be…
Let be the minimum number of edges in an bipartite graph such that adding any new edge between its two classes creates a copy of . Let…