Complete Subgraphs of r-partite Graphs

DOI10.1017/S0963548300000274zbMath0793.05088MaRDI QIDQ4291201

Guoping Jin

Publication date: 4 August 1994

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

zbMATH Keywords

bounds\(r\)-partite graphcomplete subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (16)

Full rainbow matchings in graphs and hypergraphs ⋮ Complete subgraphs in a multipartite graph ⋮ Bounded transversals in multipartite graphs ⋮ The Density Turán Problem ⋮ Independent transversals in locally sparse graphs ⋮ An average degree condition for independent transversals ⋮ On a conjecture of Stein ⋮ Graphs of low average degree without independent transversals ⋮ Fair Representation by Independent Sets ⋮ The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm ⋮ Problems and results in extremal combinatorics. I. ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Finding independent transversals efficiently ⋮ The number of complete subgraphs of equi-partite graphs ⋮ Cooperative colorings and independent systems of representatives

Cites Work

• On complete subgraphs of \(r\)-chromatic graphs

This page was built for publication: Complete Subgraphs of r-partite Graphs