Knowledge (XXG)

Category:Hypergraphs

Source đź“ť

346: 257: 162: 138: 36: 315: 206: 303: 218: 150: 126: 177: 252: 240: 230: 97: 327: 279: 167: 121: 103: 65: 235: 75: 194: 60: 262: 109: 17: 92: 340: 172: 80: 267: 48: 22: 182: 291: 70: 35:
The following 34 pages are in this category, out of 34 total.
8: 258:Perfect matching in high-degree hypergraphs 347:Extensions and generalizations of graphs 37:This list may not reflect recent changes 7: 163:Hall-type theorems for hypergraphs 41: 29: 14: 139:Forbidden graph characterization 32:Pages in category "Hypergraphs" 1: 316:Vertex cover in hypergraphs 363: 304:Truncated projective plane 219:Line graph of a hypergraph 151:Graph (abstract data type) 127:Discrepancy of hypergraphs 16:The main article for this 15: 178:Hypergraph removal lemma 280:Ryser's conjecture 253:Packing in a hypergraph 241:Mutually unbiased bases 231:Matching in hypergraphs 66:Baranyai's theorem 207:Kruskal–Katona theorem 98:Conflict-free coloring 328:Width of a hypergraph 168:Hedgehog (hypergraph) 122:D-interval hypergraph 104:Constraint hypergraph 236:Monotone dualization 76:Bipartite hypergraph 195:Independence system 61:Balanced hypergraph 354: 263:Projective plane 110:Container method 106: 362: 361: 357: 356: 355: 353: 352: 351: 337: 336: 335: 334: 333: 332: 320: 308: 296: 284: 272: 245: 223: 211: 199: 187: 155: 143: 131: 114: 102: 85: 53: 28: 27: 12: 11: 5: 360: 358: 350: 349: 339: 338: 331: 330: 324: 321: 319: 318: 312: 309: 307: 306: 300: 297: 295: 294: 288: 285: 283: 282: 276: 273: 271: 270: 265: 260: 255: 249: 246: 244: 243: 238: 233: 227: 224: 222: 221: 215: 212: 210: 209: 203: 200: 198: 197: 191: 188: 186: 185: 180: 175: 170: 165: 159: 156: 154: 153: 147: 144: 142: 141: 135: 132: 130: 129: 124: 118: 115: 113: 112: 107: 100: 95: 93:Clique complex 89: 86: 84: 83: 78: 73: 68: 63: 57: 54: 52: 51: 45: 43: 42: 33: 30: 13: 10: 9: 6: 4: 3: 2: 359: 348: 345: 344: 342: 329: 326: 325: 322: 317: 314: 313: 310: 305: 302: 301: 298: 293: 290: 289: 286: 281: 278: 277: 274: 269: 266: 264: 261: 259: 256: 254: 251: 250: 247: 242: 239: 237: 234: 232: 229: 228: 225: 220: 217: 216: 213: 208: 205: 204: 201: 196: 193: 192: 189: 184: 181: 179: 176: 174: 171: 169: 166: 164: 161: 160: 157: 152: 149: 148: 145: 140: 137: 136: 133: 128: 125: 123: 120: 119: 116: 111: 108: 105: 101: 99: 96: 94: 91: 90: 87: 82: 79: 77: 74: 72: 69: 67: 64: 62: 59: 58: 55: 50: 47: 46: 44: 40: 38: 31: 25: 24: 19: 173:Helly family 81:Blocking set 34: 21: 268:Property B 49:Hypergraph 23:Hypergraph 183:Hypertree 341:Category 292:SIC-POVM 71:BF-graph 18:category 20:is 343:: 39:. 323:W 311:V 299:T 287:S 275:R 248:P 226:M 214:L 202:K 190:I 158:H 146:G 134:F 117:D 88:C 56:B 26:.

Index

category
Hypergraph
This list may not reflect recent changes
Hypergraph
Balanced hypergraph
Baranyai's theorem
BF-graph
Bipartite hypergraph
Blocking set
Clique complex
Conflict-free coloring
Constraint hypergraph
Container method
D-interval hypergraph
Discrepancy of hypergraphs
Forbidden graph characterization
Graph (abstract data type)
Hall-type theorems for hypergraphs
Hedgehog (hypergraph)
Helly family
Hypergraph removal lemma
Hypertree
Independence system
Kruskal–Katona theorem
Line graph of a hypergraph
Matching in hypergraphs
Monotone dualization
Mutually unbiased bases
Packing in a hypergraph
Perfect matching in high-degree hypergraphs

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑