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

Bipartite Coverings of Graphs

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

DOI10.1017/S0963548397003064zbMath0894.05022OpenAlexW2130631679MaRDI QIDQ4354593

Andrzej Ruciński, Vojtěch Rödl

Publication date: 29 July 1998

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003064


zbMATH Keywords

coveringprobabilistic methodcomplete bipartite subgraphs


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (4)

Biclique covers and partitions ⋮ The Excluded Minors for Isometric Realizability in the Plane ⋮ Bounded-depth succinct encodings and the structure they imply on graphs ⋮ On covering graphs by complete bipartite subgraphs




This page was built for publication: Bipartite Coverings of Graphs

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