A Problem in Graph Theory
From MaRDI portal
Publication:5331782
DOI10.2307/2311408zbMath0126.39401OpenAlexW1990490082MaRDI QIDQ5331782
Publication date: 1964
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ec5e9df34a4671c07d54d73e0e6b67be47cb71af
Related Items (only showing first 100 items - show all)
Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Order plus size of τ‐critical graphs ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Saturation of Ordered Graphs ⋮ Weak saturation number of a complete bipartite graph ⋮ A note on the minimum size of matching-saturated graphs ⋮ Rainbow Saturation for Complete Graphs ⋮ The saturation number of \(K_{3,3}\) ⋮ Saturation numbers for linear forests $P_6 + tP_2$ ⋮ Cycle Saturation in Random Graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Tight concentration of star saturation number in random graphs ⋮ Some results on the saturation number for unions of cliques ⋮ Saturation numbers for Berge cliques ⋮ On fan-saturated graphs ⋮ The induced saturation problem for posets ⋮ Symmetric complete sum-free sets in cyclic groups ⋮ Bounds For Invariants of Edge-Rings ⋮ MinimumK2, 3-Saturated Graphs ⋮ On generalized graphs ⋮ On saturation of Berge hypergraphs ⋮ Graphs with induced-saturation number zero ⋮ Almost all permutation matrices have bounded saturation functions ⋮ Hyperconnectivity of graphs ⋮ Uniquely \(K_r^{(k)}\)-saturated hypergraphs ⋮ Uniquely tree-saturated graphs ⋮ A lower bound on the saturation number, and graphs for which it is sharp ⋮ Saturation numbers for nearly complete graphs ⋮ Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Guessing numbers and extremal graph theory ⋮ Extremal theory for convex matchings in convex geometric graphs ⋮ Rainbow Saturation and Graph Capacities ⋮ Minimum degree and the minimum size of \(K_2^t\)-saturated graphs ⋮ Cycle-saturated graphs of minimum size ⋮ A note on \(\tau\)-critical linear hypergraphs ⋮ On minimum saturated matrices ⋮ Saturating Sperner families ⋮ The partite saturation number of spider ⋮ Deterministic Subgraph Detection in Broadcast CONGEST. ⋮ Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ A note on rainbow saturation number of paths ⋮ Uniquely \(C _{4}\)-saturated graphs ⋮ Improved bounds for induced poset saturation ⋮ On saturated \(k\)-Sperner systems ⋮ The minimum number of clique-saturating edges ⋮ Linearity of saturation for Berge hypergraphs ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ The minimum spectral radius of \(K_{r + 1}\)-saturated graphs ⋮ Star saturation number of random graphs ⋮ Saturated Subgraphs of the Hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Saturated Graphs of Prescribed Minimum Degree ⋮ Ramsey-minimal saturation numbers for matchings ⋮ The edge spectrum of the saturation number for small paths ⋮ Saturation problems in convex geometric hypergraphs ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ The size of connected hypergraphs with prescribed covering number ⋮ Saturation Numbers in Tripartite Graphs ⋮ Induced saturation number ⋮ Saturation number of Berge stars in random hypergraphs ⋮ Unnamed Item ⋮ Game matching number of graphs ⋮ Asymptotic results on saturated graphs ⋮ On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs ⋮ Induced saturation of graphs ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ On induced saturation for paths ⋮ Very large cliques are easy to detect ⋮ \(K_{s,t}\)-saturated bipartite graphs ⋮ All minimum C5-saturated graphs ⋮ Extremal Graphs with Local Covering Conditions ⋮ Saturated \(r\)-uniform hypergraphs ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Regular saturated graphs and sum-free sets ⋮ On saturation games ⋮ Extremal problems on saturation for the family of $k$-edge-connected graphs ⋮ Minimum clique-free subgraphs of Kneser graphs ⋮ Unnamed Item ⋮ Asymptotic growth of sparse saturated structures is locally determined ⋮ Saturation of Berge hypergraphs ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ The game of \(\mathcal F\)-saturator ⋮ Exact bounds for some hypergraph saturation problems ⋮ Unnamed Item ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ Extremal graphs with prescribed covering number ⋮ Partite Saturation of Complete Graphs ⋮ Unnamed Item ⋮ A generalization of the Bollobás set pairs inequality ⋮ The saturation number for the length of degree monotone paths ⋮ Saturation Problems about Forbidden 0-1 Submatrices ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Kanten-kritische Graphen mit der Zusammenhangszahl 2 ⋮ Saturated Simple and 2-simple Topological Graphs with Few Edges ⋮ Spectral strengthening of a theorem on transversal critical graphs
This page was built for publication: A Problem in Graph Theory
