Finite and Infinite Sets, Issue 37, Part 2A. Hajnal, László Lovász, Vera T. Sós North-Holland, 1984 - Combinatorial analysis |
Contents
Karzanov A generalized MFMCproperty and multicommodity | 443 |
A K Kelmans Finding special subdivisions of K₁ in a graph | 487 |
P Kirschenhofer H Prodinger On the average height | 509 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
1-factorable 4-blocks A₁ a₂ almost-disjoint B₁ B₂ block c₁ C₂ Cayley graphs chain chromatic number circuits COLLOQUIA MATHEMATICA SOCIETATIS Combinatorial contradiction cycle defined denote digraph disjoint e₁ e₂ edges EGER HUNGARY elements Erdős exists FINITE AND INFINITE function G₁ graph G Graph Theory graphs of order H₁ Hadamard matrix Hence hypergraph implies induced subgraph induction inequality INFINITE SETS integer JÁNOS BOLYAI JÁNOS BOLYAI 37 K₁ Lemma Let G linear extension Math MATHEMATICA SOCIETATIS JÁNOS matrix maximal non-adjacent obtained oriented matroid Petersen graph planar planar graphs polynomials poset Pr(G Proof Proposition proved r-uniform regular graphs result S₁ S₂ satisfies SOCIETATIS JÁNOS BOLYAI solution Sperner family strongly perfect subdivision subposet subsets Suppose symmetric graphs T-critical Theorem threads tree hypergraph U₁ unit pairs upper bound v₁ vector vertex symmetric graphs vertices w₁ x₁ x₂