scientific article; zbMATH DE number 3468904

MaRDI QIDQ4053708zbMATH OpenFDO

Authors Thorkell Helgason

Publication date 1974

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited in

(28)

• Matroids on partially ordered sets
• Some excluded-minor theorems for a class of polymatroids
• A 2-isomorphism theorem for hypergraphs
• An inequality for polymatroid functions and its applications.
• The Go polynomials of a graph.
• Arrangements, channel assignments, and associated polynomials
• Secret sharing and duality
• Universal Tutte polynomial
• Matroid bases with cardinality constraints on the intersection
• Decomposable polymatroids and connections with graph coloring
• Polymatroid-based capacitated packing of branchings
• Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
• A splitter theorem for 3-connected 2-polymatroids
• Certificates for properties of stability polynomials of graphs
• Bounding the payment of approximate truthful mechanisms
• Problems on chromatic polynomials of hypergraphs
• A new polynomial for polymatroids
• Bipartite secret sharing and staircases
• The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids
• The Natural Matroid of an Integer Polymatroid
• A simplified analysis of the ascending auction to sell a matroid base
• Tropical toric vector bundles
• Shortest paths on polymatroids and hypergraphic polytopes
• Combinatorial flats and Schubert varieties of subspace arrangements
• Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
• Hopf algebraic structures on hypergraphs and multi-complexes
• The Bergman fan of a polymatroid
• Graph polynomials: some questions on the edge

This page was built for publication:

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