Complete Subgraphs of r-partite Graphs

DOI10.1017/S0963548300000274MaRDI QIDQ4291201zbMATH OpenFDO

Authors Guoping Jin

Publication date 4 August 1994

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

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

zbMATH Keywords

\(r\)-partite graphboundscomplete subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• The number of complete subgraphs of equi-partite graphs
• Complete subgraphs in a multipartite graph
• On the minimal degree condition of graphs implying equality of the largest K_r-free subgraphs and (r - 1)-partite subgraphs
• On complete subgraphs of r-chromatic graphs

Cites work

• On complete subgraphs of r-chromatic graphs

Cited in

(28)

• Complete \(r\)-partite subgraphs of dense \(r\)-graphs
• Problems and results in extremal combinatorics. I.
• The number of complete subgraphs of equi-partite graphs
• On a conjecture of Stein
• Integral complete \(r\)-partite graphs
• \(Q\)-integral complete \(r\)-partite graphs
• Finite rigid subgraphs of pants graphs
• Cooperative colorings and independent systems of representatives
• Independent transversals in locally sparse graphs
• Complete subgraphs in multipartite graphs
• An average degree condition for independent transversals
• Bounded transversals in multipartite graphs
• The density Turán problem
• Acyclic systems of representatives and acyclic colorings of digraphs
• Fair representation by independent sets
• The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• Two disjoint independent bases in matroid-graph pairs
• Finding independent transversals efficiently
• Graphs with many r -cliques have large complete r -partite subgraphs
• Full rainbow matchings in graphs and hypergraphs
• Complete subgraphs in a multipartite graph
• Graphs of low average degree without independent transversals
• Constructing graphs with no independent transversals
• A neighborhood condition which implies the existence of a complete multipartite subgraph
• Bounded degree graphs and hypergraphs with no full rainbow matchings
• A stability theorem for multi-partite graphs
• Approximate packing of independent transversals in locally sparse graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291201)