222:
53:
There has also been study of optimization problems on matroids where the objective function of the optimization depends on the set of colors chosen as part of a matroid basis.
263:
31:
whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first
287:
67:
256:
282:
141:
249:
146:
106:
62:
233:
188:
151:
96:
39:
202:
179:
Maffioli, Francesco; Rizzi, Romeo; Benati, Stefano (2007), "Least and most colored bases",
165:
118:
198:
161:
114:
276:
229:
156:
38:
The interest in colored matroids is through their invariants, especially the colored
221:
43:
20:
193:
87:
Zaslavsky, Thomas (1992), "Strong Tutte functions of matroids and graphs",
110:
28:
101:
132:
Kauffman, Louis H. (1989), "A Tutte polynomial for signed graphs",
237:
89:Transactions of the American Mathematical Society
35:positive integers, or the sign set {+, −}.
42:, which generalizes the Tutte polynomial of a
257:
8:
264:
250:
192:
155:
145:
100:
47:
16:Abstract structure with colored elements
79:
7:
218:
216:
236:. You can help Knowledge (XXG) by
14:
220:
1:
181:Discrete Applied Mathematics
157:10.1016/0166-218X(89)90049-8
134:Discrete Applied Mathematics
304:
215:
194:10.1016/j.dam.2007.04.015
68:Rota's basis conjecture
232:-related article is a
288:Combinatorics stubs
245:
244:
187:(15): 1958–1970,
63:Bipartite matroid
295:
266:
259:
252:
224:
217:
207:
205:
196:
176:
170:
168:
159:
149:
140:(1–2): 105–127,
129:
123:
121:
104:
84:
40:Tutte polynomial
303:
302:
298:
297:
296:
294:
293:
292:
273:
272:
271:
270:
213:
211:
210:
178:
177:
173:
147:10.1.1.183.2851
131:
130:
126:
102:10.2307/2153985
86:
85:
81:
76:
59:
48:Kauffman (1989)
25:colored matroid
17:
12:
11:
5:
301:
299:
291:
290:
285:
283:Matroid theory
275:
274:
269:
268:
261:
254:
246:
243:
242:
225:
209:
208:
171:
124:
95:(1): 317–347,
78:
77:
75:
72:
71:
70:
65:
58:
55:
15:
13:
10:
9:
6:
4:
3:
2:
300:
289:
286:
284:
281:
280:
278:
267:
262:
260:
255:
253:
248:
247:
241:
239:
235:
231:
230:combinatorics
226:
223:
219:
214:
204:
200:
195:
190:
186:
182:
175:
172:
167:
163:
158:
153:
148:
143:
139:
135:
128:
125:
120:
116:
112:
108:
103:
98:
94:
90:
83:
80:
73:
69:
66:
64:
61:
60:
56:
54:
51:
49:
45:
41:
36:
34:
30:
26:
22:
238:expanding it
227:
212:
184:
180:
174:
137:
133:
127:
92:
88:
82:
52:
44:signed graph
37:
32:
24:
18:
21:mathematics
277:Categories
74:References
142:CiteSeerX
57:See also
203:2351979
166:1031266
119:1080738
111:2153985
29:matroid
201:
164:
144:
117:
109:
228:This
107:JSTOR
27:is a
234:stub
23:, a
189:doi
185:155
152:doi
97:doi
93:334
46:of
19:In
279::
199:MR
197:,
183:,
162:MR
160:,
150:,
138:25
136:,
115:MR
113:,
105:,
91:,
50:.
265:e
258:t
251:v
240:.
206:.
191::
169:.
154::
122:.
99::
33:n
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
