scientific article
From MaRDI portal
Publication:3137188
zbMath0785.05082MaRDI QIDQ3137188
Péter Hajnal, Vojtěch Rödl, William T. jun. Trotter, Zoltan Fueredi
Publication date: 13 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
The order dimension of two levels of the Boolean lattices ⋮ The dimension of interior levels of the Boolean lattice ⋮ The dimension of suborders of the Boolean lattice ⋮ Incidence posets of trees in posets of large dimension ⋮ Forcing posets with large dimension to contain large standard examples ⋮ Planar posets, dimension, breadth and the number of minimal elements ⋮ On-line dimension of semi-orders ⋮ Segment orders ⋮ Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ On the order dimension of 1-sets versus \(k\)-sets ⋮ Dimension of restricted classes of interval orders ⋮ Boolean dimension and tree-width ⋮ Covering line graphs with equivalence relations ⋮ Trees and circle orders ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ The order dimension of the poset of regions in a hyperplane arrangement. ⋮ A note on the orientation covering number ⋮ On the minimum number of completely 3-scrambling permutations ⋮ The dimension of cycle-free orders ⋮ Fractional dimension of partial orders ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ Boolean layer cakes ⋮ Interval orders, semiorders and ordered groups ⋮ The maximum number of edges in a graph of bounded dimension, with applications to ring theory ⋮ The order dimension of the complete graph ⋮ Locally restricted colorings ⋮ The covering threshold of a directed acyclic graph by directed acyclic subgraphs
