Graph Theory and Probability
From MaRDI portal
Publication:3253064
DOI10.4153/CJM-1959-003-9zbMath0084.39602WikidataQ55869075 ScholiaQ55869075MaRDI QIDQ3253064
Publication date: 1959
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Ramsey properties of orientations of graphs, Linear-Time Approximation Algorithms for the Max Cut Problem, Coloring graphs with fixed genus and girth, The circular chromatic number of a digraph, Erdős Graphs Resolve Fine's Canonicity Problem, Interpolation in Logiken monotoner systeme, A review of random graphs, Unnamed Item, Unnamed Item, Algorithmic bounds for the chromatic number†, Coloring-flow duality of embedded graphs, Canonical varieties with no canonical axiomatisation, INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS, Claw‐decompositions and tutte‐orientations, Random graphs and covering graphs of posets, More results on Ramsey-Turán type problems, Ramsey-type theorems, Ramsey numbers and an approximation algorithm for the vertex cover problem, Infinite generalized friendship graphs, What must and what need not be contained in a graph of uncountable chromatic number?, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, Independence number and vertex-disjoint cycles, Paths with two blocks in \(n\)-chromatic digraphs, A separation theorem in property testing, Obligatory subsystems of triple systems, Locally planar graphs are 5-choosable, Note on a Ramsey-Turán type problem, Coloring graphs with locally few colors, Independent sets in k-chromatic graphs, Large minimal sets which force arithmetic progressions, Probabilistic methods, Fuzzy intersection graphs, Representing orders on the plane by translating convex figures, Applications of edge coloring of multigraphs to vertex coloring of graphs, The distribution of the maximum degree of a random graph, On semigroups of graph endomorphisms, Degree sequences of random graphs, On the coverings of graphs, Critically partitionable graphs. II, Graphs without large triangle free subgraphs, Reorientations of covering graphs, Computing independent sets in graphs with large girth, On cubical graphs, Chromatic number and girth, Restricted Ramsey configurations, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, Colouring lattices, Asymptotic lower bounds for Ramsey functions, Survey sampling in graphs, On classes of relations and graphs determined by subobjects and factorobjects, Chromatic number, girth and maximal degree, A short proof of the existence of highly chromatic hypergraphs without short cycles, Elements of a theory of computer simulation. I, Around quasidiagonal operators, Complexity of diagrams, Probabilistic methods in coloring and decomposition problems, Compactness and finite equivalence of infinite digraphs, Some theorems concerning the star chromatic number of a graph, On some conjectures of Graffiti, The number of dependent arcs in an acyclic orientation, Inequalities for the chromatic numbers of graphs, A few remarks on Ramsey--Turán-type problems, Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, 3-colorability and forbidden subgraphs. I: Characterizing pairs, On sparse graphs with given colorings and homomorphisms., 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs., Triangle-free graphs and forbidden subgraphs, Conditional chromatic numbers with forbidden cycles, Degree multiplicities and independent sets in \(K_ 4\)-free graphs, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Compactness results in extremal graph theory, From graphs to ortholattices and equivariant maps, Nearly bipartite graphs with large chromatic number, Density via duality., Tough Ramsey graphs without short cycles, Degree sequence and independence in \(K(4)\)-free graphs, Finitely axiomatizable quasivarieties of graphs, Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions, An intersection theorem for four sets, A dualistic approach to bounding the chromatic number of a graph, A small set in a large parallelepiped., Toughness in graphs -- a survey, The line analog of Ramsey numbers, Another analog of Ramsey numbers, A coloring problem, Arity hierarchies, Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture, A hierarchy of randomness for graphs, On the complexity of unfrozen problems, Almost all graphs with high girth and suitable density have high chromatic number, Strongly representable atom structures of relation algebras, A Separator Theorem for String Graphs and Its Applications, Local chromatic number and distinguishing the strength of topological obstructions, On Random Representable Matroids, On generalized graph colorings, Unnamed Item, On circuits and subgraphs of chromatic graphs, Unnamed Item, On cycle—Complete graph ramsey numbers, Point Partition Numbers and Girth, On the dimension of a graph, On chromatic number of graphs and set-systems, Zur Geometrie der Kreislagerungen, On chromatic number of finite set-systems, Partition relations for cardinal numbers, On decomposition of graphs, Acyclic colorings of planar graphs
