scientific article; zbMATH DE number 3613058

MaRDI QIDQ4177585zbMATH OpenFDO

Authors T. G. Tarján

Publication date 1977

zbMATH Keywords

Complexity of Lattice-Configurations

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30)

Cited in

(14)

• Critical hypergraphs and interesting set-pair systems
• New lower bounds for Hopcroft's problem
• Variations on the Bollobás set-pair theorem
• Combinatorics in the exterior algebra and the Bollobás two families theorem
• Graph-intersecting set systems and LYM inequalities
• Some new Bollobás-type inequalities
• Local k-colorings of graphs and hypergraphs
• Bollobás-type theorems for hemi-bundled two families
• On Bollobás-type theorems of d-tuples
• Finding bipartite subgraphs efficiently
• Variations on Bollobás systems of d-partitions
• Geometrical solution of an intersection problem for two hypergraphs
• A generalization of the Bollobás set pairs inequality
• Bollobás set pair inequalities for compositions

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 Q4177585)