The following pages link to A Problem in Graph Theory (Q5331782):
Displaying 50 items.
- On saturation of Berge hypergraphs (Q2122672) (← links)
- A lower bound on the saturation number, and graphs for which it is sharp (Q2138956) (← links)
- Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
- Guessing numbers and extremal graph theory (Q2152800) (← links)
- A note on rainbow saturation number of paths (Q2177906) (← links)
- Improved bounds for induced poset saturation (Q2185221) (← links)
- The minimum spectral radius of \(K_{r + 1}\)-saturated graphs (Q2198388) (← links)
- Saturation number of Berge stars in random hypergraphs (Q2215467) (← links)
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs (Q2223466) (← links)
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397) (← links)
- On induced saturation for paths (Q2225408) (← links)
- Two graph theoretical problems (Q2227761) (← links)
- Regular saturated graphs and sum-free sets (Q2237233) (← links)
- Minimum clique-free subgraphs of Kneser graphs (Q2243816) (← links)
- Exact bounds for some hypergraph saturation problems (Q2259864) (← links)
- \(C_{2k}\)-saturated graphs with no short odd cycles (Q2334067) (← links)
- Graph cover-saturation (Q2334084) (← links)
- Saturated simple and \(k\)-simple topological graphs (Q2344053) (← links)
- On the number of edges in a minimum \(C_6\)-saturated graph (Q2354620) (← links)
- Saturation numbers for nearly complete graphs (Q2376107) (← links)
- Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
- Ramsey-minimal saturation numbers for matchings (Q2436829) (← links)
- A note on the saturation number of the family of \(k\)-connected graphs (Q2439131) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- The saturation number for the length of degree monotone paths (Q2516681) (← links)
- Kanten-kritische Graphen mit der Zusammenhangszahl 2 (Q2538487) (← links)
- \(C_{3}\) saturated graphs (Q2566152) (← links)
- The partite saturation number of spider (Q2662643) (← links)
- Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph (Q2665959) (← links)
- The minimum number of clique-saturating edges (Q2680567) (← links)
- Saturation problems in convex geometric hypergraphs (Q2701003) (← links)
- Saturated Simple and 2-simple Topological Graphs with Few Edges (Q2827825) (← links)
- Minimum \(C_k\)-saturated graphs (Q2857396) (← links)
- Saturation Numbers in Tripartite Graphs (Q2978183) (← links)
- All minimum C5-saturated graphs (Q2998920) (← links)
- On the minimal number of vertices representing the edges of a graph (Q3284375) (← links)
- Extremal Graphs with Local Covering Conditions (Q3300760) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- (Q3390440) (← links)
- (Q3728935) (← links)
- (Q4416560) (← links)
- Rainbow Saturation and Graph Capacities (Q4564887) (← links)
- Cycle-Saturated Graphs with Minimum Number of Edges (Q4920660) (← links)
- Saturation Problems about Forbidden 0-1 Submatrices (Q4959655) (← links)
- Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs (Q4992838) (← links)
- Generalized sum-free sets and cycle saturated regular graphs (Q5057065) (← links)
- Partite Saturation of Complete Graphs (Q5204066) (← links)
- Uniquely Cycle‐Saturated Graphs (Q5272635) (← links)
- Partite Saturation Problems (Q5272927) (← links)
