Cuts and bounds

DOI10.1016/J.DISC.2004.07.034MaRDI QIDQ2575795zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, P. Ossona de Mendez

Publication date 6 December 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.07.034

zbMATH Keywords

Homomorphism extremaHomomorphism order

Mathematics Subject Classification ID

Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Algebraic combinatorics (05E99) Combinatorics of partially ordered sets (06A07) Graph theory (05C99)

Recommendations

• Bounds and extrema for classes of graphs and finite structures
• Tree-depth, subgraph coloring and homomorphism bounds
• Homomorphism bounded classes of graphs
• On a new reformulation of Hadwiger's conjecture
• Homomorphism bounds for oriented planar graphs

Cites work

• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 927067 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Chromatically optimal rigid graphs
• Colorings and homomorphisms of degenerate and bounded degree graphs
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• On chromatic number of finite set-systems
• On chromatic number of graphs and set-systems
• On maximal finite antichains in the homomorphism order of directed graphs
• Random cubic graphs are not homomorphic to the cycle of size 7
• Regular graphs with no homomorphisms onto cycles
• The complexity of \(H\)-colouring of bounded degree graphs
• Universal \(H\)-colorable graphs without a given configuration
• Universal graphs with forbidden subgraphs and algebraic closure
• Universality of \(A\)-mote graphs

Cited in

(16)

• Folding
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• Homomorphism order of connected monounary algebras
• Cut Admissibility by Saturation
• Cuts and gluts
• Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
• Many Facets of Dualities
• Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
• Colouring, constraint satisfaction, and complexity
• Bounds and extrema for classes of graphs and finite structures
• Cut for core logic
• scientific article; zbMATH DE number 4065050 (Why is no real title available?)
• Finite duality for some minor closed classes
• scientific article; zbMATH DE number 1285977 (Why is no real title available?)
• Extended cuts
• Cut-Based Abduction

This page was built for publication: Cuts and bounds

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