Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The saturation function of complete partite graphs

From MaRDI portal
Publication:543991
Jump to:navigation, search

DOI10.4310/JOC.2010.v1.n2.a5zbMath1221.05208OpenAlexW2094522815MaRDI QIDQ543991

Tom Bohman, Oleg Pikhurko, Maria A. Fonoberova

Publication date: 14 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2010.v1.n2.a5


zbMATH Keywords

saturation functionsaturated graphs


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (10)

Saturating Sperner families ⋮ On saturated \(k\)-Sperner systems ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ The saturation number of \(K_{3,3}\) ⋮ Saturation numbers for linear forests $P_6 + tP_2$ ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ Unnamed Item ⋮ Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs ⋮ MinimumK2, 3-Saturated Graphs






This page was built for publication: The saturation function of complete partite graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:543991&oldid=12434397"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 06:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki