… In this paper, we investigate how many matroids we need to represent the clique complex of
… complexes. We will show that the clique complex of a given graph G is the intersection of k …

… a "complex structure" can be isolated. Our development features a topological representation
theorem for 2-matroids and complex matroids, and … structure in the complex case. Duality is …

… clique problem from the viewpoint of matroid theory. More precisely, we consider … clique
complex of a graph (the collection of all cliques of the graph) which is also called a flag complex, …

… representation theories. In the next section we observe that the p-representations of a matroid
… First, let us consider the graphic matroid M (K 4 ) , ie the cycle matroid of the clique on four …

… each of two given matroids. We study in detail the case in which the complex is the complex
of … are the special case in which the matroid is a partition matroid). In particular, we define a …

… of lattice representation and lattice of all boolean representations of a (boolean representable)
simplicial complex, which includes all matroids. … We say that a nontrivial clique C Â V is a …

… nary matroid MA(G) on V (G). MA(G) may be obtained from the deltamatroid represented
by … Jaeger proved that every binary matroid is MA(G) for some G [Ann. Discrete Math. 17 (1983)…

… the edges according to their costs, and the time complexity of the greedy algorithm is O(m2 …
maximal clique that we find we also check if the subsets that correspond to this clique satisfy …

… Wir betrachten Konfigurationen, die man aus der Familie von Basen eines Matroids erhält
und zeigen, dass die Klasse von Matroiden mit beschränktem Theta-Rang beziehungsweise …

… simplicial complexes and clique complexes. We prove a necessary and sufficient condition
for any simplicial complex to be a clique complex … as the intersection of n − 1 matroids. In this …