scientific article; zbMATH DE number 3561367
From MaRDI portal
Publication:4133994
zbMath0361.05027MaRDI QIDQ4133994
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Finite affine and projective planes (geometric aspects) (51E15) Combinatorial aspects of matroids and geometric lattices (05B35) Exterior algebra, Grassmann algebras (15A75) Projective analytic geometry (51N15)
Related Items
On Generic Rigidity in the Plane, Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Linear and combinatorial sharing problems, Weakly saturated hypergraphs and a conjecture of Tuza, Deterministic Truncation of Linear Matroids, Matroids of gain graphs in applied discrete geometry, Some combinatorial-algebraic problems from complexity theory, A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, On two set-systems with restricted cross-intersections, On the kernel of intersecting families, Generalized polymatroids and submodular flows, Helly-type theorems for varieties, Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\), Set systems related to a house allocation problem, Long running times for hypergraph bootstrap percolation, A splitter theorem for 3-connected 2-polymatroids, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Weak saturation stability, On the running time of hypergraph bootstrap percolation, Weak saturation number of a complete bipartite graph, Rainbow Saturation for Complete Graphs, Representative families: a unified tradeoff-based approach, Unnamed Item, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids, The Natural Matroid of an Integer Polymatroid, Tolerance in Helly-type theorems, Inclusion matrices for rainbow subsets, A randomized polynomial kernel for subset feedback vertex set, Graphic Submodular Function Minimization: A Graphic Approach and Applications, Amalgamation of matroids and its applications, An extremal problem for two families of sets, Arrangements, channel assignments, and associated polynomials, Point-hyperplane frameworks, slider joints, and rigidity preserving transformations, Weak saturation numbers of complete bipartite graphs in the clique, The edge covering number of the intersection of two matroids, On the number of zero-patterns of a sequence of polynomials, Bounding the payment of approximate truthful mechanisms, Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization, \(K_{s,t}\)-saturated bipartite graphs, Polymatroids: Construction and random algorithms, Computing the Chromatic Number Using Graph Decompositions via Matrix Rank, Minimum clique-free subgraphs of Kneser graphs, Bounded degrees and prescribed distances in graphs, Matroid matching with Dilworth truncation, Metrical service systems with multiple servers, Intersecting families of discrete structures are typically trivial, Exact bounds for some hypergraph saturation problems, Duality for balanced submodular flows, Flattening rank and its combinatorial applications, On the exterior algebra method applied to restricted set addition, A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids, A generalization of the Bollobás set pairs inequality, Weak saturation numbers for multiple copies, Matchings and covers in hypergraphs, Bounds on the Maximum Number of Vectors with given Scalar Products, A Helly type theorem for hypersurfaces, Bollobás-type theorems for hemi-bundled two families, Intersection patterns of convex sets, Rank Vertex Cover as a Natural Problem for Algebraic Compression, A parameterized view on matroid optimization problems, Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs, Computing the chromatic number using graph decompositions via matrix rank, Unavoidable minors for connected 2-polymatroids, On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method, An algebraic and combinatorial approach to the analysis of line drawings of polyhedra, Geometrical solution of an intersection problem for two hypergraphs, Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions, Stable sets and polynomials, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, An extremal problem for sets with applications to graph theory, Critical hypergraphs and interesting set-pair systems
