Complete subgraphs in a multipartite graph
From MaRDI portal
Publication:5886355
DOI10.1017/S0963548322000141MaRDI QIDQ5886355FDOQ5886355
Andrew Treglown, Yi Zhao, Allan Lo
Publication date: 31 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.02370
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Transversal (matching) theory (05D15)
Cites Work
- Title not available (Why is that?)
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- The linear arboricity of graphs
- Density conditions for triangles in multipartite graphs
- On complete subgraphs of \(r\)-chromatic graphs
- Complete Subgraphs of r-partite Graphs
- Extremal problems for transversals in graphs with bounded degree
- Odd Independent Transversals are Odd
- Weighted Turán problems with applications
- A note on vertex list colouring
- Turán number of disjoint triangles in 4-partite graphs
- Complete subgraphs in multipartite graphs
Cited In (9)
- Complete multipartite graphs and Braess edges
- Partition of a graph with its complete sub-graphs
- Title not available (Why is that?)
- On the complete subgraphs of graphs defined by systems of sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete subgraphs in multipartite graphs
- On density conditions for transversal trees in multipartite graphs
- On subgraphs of tripartite graphs
This page was built for publication: Complete subgraphs in a multipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886355)
