Complete graph immersions and minimum degree

DOI10.1002/jgt.22206zbMath1391.05084arXiv1512.00513OpenAlexW2963651014MaRDI QIDQ4575527

Zdeněk Dvořák, Liana Yepremyan

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00513

zbMATH Keywords

immersionminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (9)

Large immersions in graphs with independence number 3 and 4 ⋮ Clique immersion in graphs without a fixed bipartite graph ⋮ Clique immersions and independence number ⋮ Clique immersion in graph products ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Forcing clique immersions through chromatic number ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Immersion and clustered coloring

This page was built for publication: Complete graph immersions and minimum degree