A surprising permanence of old motivations (a not-so-rigid story)
From MaRDI portal
Publication:1045032
DOI10.1016/j.disc.2008.04.055zbMath1183.01032OpenAlexW2123818174MaRDI QIDQ1045032
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.055
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Biographies, obituaries, personalia, bibliographies (01A70) Structural characterization of families of graphs (05C75) History of combinatorics (05-03)
Related Items
Cites Work
- Operations with structures
- The right adjoints into the categories of relational systems
- Graphs and k-Societies
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
- Asymmetric graphs
- Finite paths are universal
- The unreasonable effectiveness of mathematics in molecular biology.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Absolute reflexive retracts and absolute bipartite retracts
- The core of a graph
- On the minimum order of graphs with given semigroup
- Packings by cliques and by finite families of graphs
- On the complexity of H-coloring
- On multiplicative graphs and the product conjecture
- Chromatically optimal rigid graphs
- Endomorphism monoids and topological subgraphs of graphs
- On a product dimension of graphs
- Quotients of rigid graphs
- Color-families are dense
- Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
- A simple proof of the multiplicativity of directed cycles of prime power length
- Minimal asymmetric graphs of induced length 4
- Universality of \(A\)-mote graphs
- On some strongly rigid families of graphs and the full embeddings they induce
- Either tournaments or algebras?
- The edge reconstruction hypothesis is true for graphs with more than n log n edges
- Homomorphisms of graphs and of their orientations
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- On classes of relations and graphs determined by subobjects and factorobjects
- On colorings of graphs without short cycles
- Homomorphisms to oriented paths
- On the order of countable graphs
- On sparse graphs with given colorings and homomorphisms.
- Universal partial order represented by means of oriented trees and other simple graphs
- Partitioning chordal graphs into independent sets and cliques
- A note on maxflow-mincut and homomorphic equivalence in matroids
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Strongly rigid relations
- Relations (graphs) with given finitely generated semigroups
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Forbidden lifts (NP and CSP for combinatorialists)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- On tension-continuous mappings
- Constraints, MMSNP and expander relational structures
- Tree-depth, subgraph coloring and homomorphism bounds
- Topics in discrete mathematics. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday
- Symmetric relations (undirected graphs) with given semigroups
- How comprehensive is the category of semigroups?
- A congruence theorem for asymmetric trees
- Every finite graph is a full subgraph of a rigid graph
- A note on the line reconstruction problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- Chromatic automorphisms of graphs
- Absolute planar retracts and the four colour conjecture
- Some remarks on simple tournaments
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- Linear time low tree-width partitions and algorithmic consequences
- Absolute Retracts and Varieties of Reflexive Graphs
- On the Complexity of General Graph Factor Problems
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- Covers and packings in a family of sets
- A Probabilistic Approach to the Dichotomy Problem
- Small Diameters of Duals
- On preservation under homomorphisms and unions of conjunctive queries
- Some new good characterizations for directed graphs
- On the Edge-sets of Rigid and Corigid Graphs
- High Chromatic Rigid Graphs II
- On strongly homogeneous tournaments
- On critical 3-chromatic hypergraphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Homomorphism Structure of Classes of Graphs
- A rigid graph for every set
- On maximal finite antichains in the homomorphism order of directed graphs
- The Existence of Homomorphisms to Oriented Cycles
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
- Duality and Polynomial Testing of Tree Homomorphisms
- Path homomorphisms
- The Unreasonable Effectiveness of Mathematics
- Classifying the Complexity of Constraints Using Finite Algebras
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Paths, Trees, and Flowers
- The complexity of satisfiability problems
- On Rigid Undirected Graphs
