\(K_{s,t}\)-saturated bipartite graphs (Q482117): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Benjamin Sudakov / rank
Normal rank
 
Property / author
 
Property / author: Benjamin Sudakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593811639 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.2471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for sets with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algebra and bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Erdos, Hajnal and Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of minimum saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds for some hypergraph saturation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:02, 9 July 2024

scientific article
Language Label Description Also known as
English
\(K_{s,t}\)-saturated bipartite graphs
scientific article

    Statements

    \(K_{s,t}\)-saturated bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2014
    0 references
    ordered complete bipartite graph
    0 references
    minimum number of edges
    0 references

    Identifiers