Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs

DOI10.1137/20M1368835zbMath1465.05179arXiv2009.07651OpenAlexW3170809533MaRDI QIDQ4992838

Debsoumya Chakraborti, Mihir Hasabnis, Da Qi Chen

Publication date: 10 June 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.07651

zbMATH Keywords

complete bipartite graphgraph saturationedge minimization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Rainbow Saturation for Complete Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear algebra and bootstrap percolation
• \(K_{s,t}\)-saturated bipartite graphs
• The saturation function of complete partite graphs
• A survey of minimum saturated graphs
• An extremal problem for sets with applications to graph theory
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• Exact bounds for some hypergraph saturation problems
• Maximal triangle‐free graphs with restrictions on the degrees
• Onk-saturated graphs with restrictions on the degrees
• Few H copies in F‐saturated graphs
• A Problem in Graph Theory
• On a Conjecture of Erdos, Hajnal and Moon
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs