Results 71 to 80 of about 145,190 (272)
Combinatorics in the Art of the Twentieth Century [PDF]
, 2017 This paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially?
Barrière Figueroa, Eulalia
core
Combinatorics and Physics [PDF]
, 2011 Item does not contain ...
Ebrahimi-Fard, K. +2 more
openaire +3 more sources
Dominating Kt ${K}_{t}$‐Models
Journal of Graph Theory, EarlyView.ABSTRACT A dominating Kt ${K}_{t}$‐model in a graph G $G$ is a sequence (T1,…,Tt) $({T}_{1},\ldots ,{T}_{t})$ of pairwise disjoint non‐empty connected subgraphs of G $G$, such that for 1⩽i
Freddie Illingworth, David R. Wood
wiley +1 more source
Incidence combinatorics of resolutions
, 2000 We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of subspace ...
Dmitry, Eva-maria Feichtner, N. Kozlov
core +4 more sources
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, EarlyView.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t≥4 $t\ge 4$ and a graph H $H$, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either Kt ${K}_{t}$ or H
Sepehr Hajebi
wiley +1 more source
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Combinatorics of Toric Arrangements
, 2018 In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement.
Pagaria, Roberto
core +1 more source
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +3 more sources
Combinatorial optimization approach for the efficient reuse of RC components
Structural Concrete, EarlyView.Abstract The reuse of reinforced concrete (RC) components from deconstructed buildings offers a promising approach to reduce the environmental impact of new constructions. However, it represents a complex combinatorial optimization problem to efficiently place the available modules, which vary in geometry and load‐bearing capacity, into new structures ...
Jannis Rose +4 more
wiley +1 more source