Solutions of irreflexive relations
From MaRDI portal
Publication:2651359
DOI10.2307/1969755zbMath0053.02902OpenAlexW2313512971MaRDI QIDQ2651359
Publication date: 1953
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969755
Related Items (67)
On kernel-perfect critical digraphs ⋮ A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ A parity digraph has a kernel ⋮ Kernels by monochromatic paths and color-perfect digraphs ⋮ Enumerating the kernels of a directed graph with no odd circuits ⋮ Computing kernels in directed bichromatic graphs ⋮ Kernels of digraphs with finitely many ends ⋮ Richardson's theorem in \(H\)-coloured digraphs ⋮ Coloring, sparseness and girth ⋮ A Polyhedral Description of Kernels ⋮ Unnamed Item ⋮ A corrected version of the Duchet kernel conjecture ⋮ A circular graph---counterexample to the Duchet kernel conjecture ⋮ Infinite kernel perfect digraphs ⋮ A note on orientation and chromatic number of graphs ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ Results on the small quasi-kernel conjecture ⋮ Unions of digraphs which become kernel perfect ⋮ The elimination of direct self-reference ⋮ Richardson's theorem in quasi-transitive and pre-transitive digraphs ⋮ Expressive power of digraph solvability ⋮ On the kernel and related problems in interval digraphs ⋮ Alternating kernels ⋮ Finding kernels or solving SAT ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ From kernels in directed graphs to fixed points and negative cycles in Boolean networks ⋮ Experimental investigation of sufficient criteria for relations to have kernels ⋮ A Ramsey bound on stable sets in Jordan pillage games ⋮ Kernels in digraphs that are not kernel perfect ⋮ Kernels in pretransitive digraphs. ⋮ Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes ⋮ Propositional discourse logic ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ Extending kernel perfect digraphs to kernel perfect critical digraphs ⋮ RUBIS: a bipolar-valued outranking method for the choice problem ⋮ Networks and Stability ⋮ On the solution of \(w\)-stable sets ⋮ -panchromatic digraphs ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ The solution of generalized stable sets and its refinement ⋮ A Richardson's theorem version for \(\Pi\)-kernels ⋮ A new generalization of kernels in digraphs ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree ⋮ Kernels in quasi-transitive digraphs ⋮ Kernels and partial line digraphs ⋮ Covering the vertex set of a graph with subgraphs of smaller degree ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels ⋮ \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs ⋮ Strategic information transmission with sender's approval ⋮ On directed graphs with an independent covering set ⋮ Strategic basins of attraction, the path dominance core, and network formation games ⋮ RESOLVING INFINITARY PARADOXES ⋮ On kernels in i-triangulated graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Über die Bestimmung von Kernen in endlichen Graphen ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ On kernels and semikernels of digraphs ⋮ On fuzzification of some concepts of graphs ⋮ Alternative foundations for Reiter's default logic ⋮ Orientations of graphs in kernel theory ⋮ An extension of Richardson's theorem in m-colored digraphs ⋮ Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
This page was built for publication: Solutions of irreflexive relations
