Note on regular subgraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199702)24:2<139::AID-JGT2>3.0.CO;2-R" /><139::AID-JGT2>3.0.CO;2-R 10.1002/(SICI)1097-0118(199702)24:2<139::AID-JGT2>3.0.CO;2-RzbMath0873.05057OpenAlexW4234939707MaRDI QIDQ4333456

Vojtěch Rödl, Beata Wysocka

Publication date: 20 February 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199702)24:2<139::aid-jgt2>3.0.co;2-r

zbMATH Keywords

boundsbipartite graphsregular subgraphscolor classes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ Maximum hypergraphs without regular subgraphs

This page was built for publication: Note on regular subgraphs