Asymmetric graphs
From MaRDI portal
Publication:5728982
DOI10.1007/BF01895716zbMath0118.18901OpenAlexW4248209491WikidataQ56853021 ScholiaQ56853021MaRDI QIDQ5728982
Publication date: 1963
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01895716
Related Items
The adjacency matrix of a graph as a data table: a geometric perspective, Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs, Regular orbits of permutation groups on the power set, Detecting almost symmetries of graphs, The poset of all copies of the random graph has the 2-localization property, Generalisations of hypomorphisms and reconstruction of hypergraphs, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Existentially closed graphs via permutation polynomials over finite fields, Fraïssé limits in comma categories, Community detection with the label propagation algorithm: a survey, Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal, Practical post-quantum signature schemes from isomorphism problems of trilinear forms, Undirecting membership in models of anti-foundation, Exploiting symmetries for scaling loopy belief propagation and relational training, Almost equitable partitions and new necessary conditions for network controllability, Minimal asymmetric graphs, Simplicial complexes and closure systems induced by indistinguishability relations, Largest non-unique subgraphs, Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines, Limited visibility cops and robber, Statistical graph space analysis, On random relational structures, Endomorphism breaking in graphs, On the exact maximum induced density of almost all graphs and their inducibility, Geometric random graphs and Rado sets in sequence spaces, A calculus for measuring the elegance of abstract graphs, Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures, Infinite quantum permutations, A novel approach to perturbative calculations for a large class of interacting boson theories, The asymmetry number of finite tournaments, and some related results, Almost all trees have quantum symmetry, Vertex nomination schemes for membership prediction, Fighting constrained fires in graphs, Random generations of the countable random graph, Distance-regular Cayley graphs over dicyclic groups, An explicit construction of \((3,t)\)-existentially closed graphs, Asymptotics of symmetry in matroids, Switching with more than two colours., Most primitive groups are full automorphism groups of edge-transitive hypergraphs., Compact navigation and distance oracles for graphs with small treewidth, Infinite random geometric graphs, Restrained domination in self-complementary graphs, Paley and the Paley Graphs, Distinguishing graphs by edge-colourings, Maximal chains of isomorphic subgraphs of the Rado graph, Typical automorphism groups of finite nonrigid structures, Enumerating alternating matrix spaces over finite fields with explicit coordinates, Low-degree factors of random polynomials, The Rado simplicial complex, The age of a relational structure, Distanced graphs, Deciding and verifying network properties locally with few output bits, Graphs with the \(n\)-e.c. adjacency property constructed from affine planes, Pairings and related symmetry notions, Finite-model theory -- A personal perspective, Neostability in countable homogeneous metric spaces, Extending partial isomorphisms of graphs, On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs, Graph of a Nearring with Respect to an Ideal, Structural Ramsey theory of metric spaces and topological dynamics of isometry groups, The isomorphism problem of trees from the viewpoint of Terwilliger algebras, Finite big Ramsey degrees in universal structures, Either tournaments or algebras?, A note on uniquely reducible graphs, On graphs isomorphic to their neighbour and non-neighbour sets, Copies of the random graph, Cohomological aspects of two-graphs, Distinguishing graphs of maximum valence 3, Homogeneous actions on the random graph, Further results on existentially closed graphs arising from block designs, Asymptotic enumeration of Cayley digraphs, On compact symmetric regularizations of graphs, On symmetry of uniform and preferential attachment graphs, Existential closure of block intersection graphs of infinite designs having finite block size and index, Existential closure of block intersection graphs of infinite designs having infinite block size, Vertex nomination: the canonical sampling and the extended spectral nomination schemes, Countable random 𝑝-groups with prescribed Ulm-invariants, Homogeneous and ultrahomogeneous linear spaces, Fixing subgraphs, Some sequences of integers, Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes, Geometric random graphs on circles, Reversibility of extreme relational structures, Deeply asymmetric planar graphs, Almost all graphs are rigid-revisited, A surprising permanence of old motivations (a not-so-rigid story), The capture time of a graph, Homogeneous Cayley objects, Counting and coding identity trees with fixed diameter and bounded degree, On the minimum order of graphs with given semigroup, Graph isomorphism problem, Classical symmetries and the quantum approximate optimization algorithm, Cyclic automorphisms of a countable graph and random sum-free sets, Universal homogeneous causal sets, Bipartite graph embeddings, Riemann surfaces and Galois groups, Almost all graphs are rigid - Revisited, No additional tournaments are quasirandom-forcing, Kolmogorov random graphs only have trivial stable colorings., Ample simplicial complexes, Ramsey theory for countable binary homogeneous structures, A note on semicompleteness of graph products of abelian groups, The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Phase transitions in the edge/concurrent vertex model, Bounds for the Twin-Width of Graphs, Asymmetrische reguläre Graphen, Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks, Random quantum graphs, Random Permutations: Some Group-Theoretic Aspects, Binary Covering Arrays and Existentially Closed Graphs, Unnamed Item, Evolving Shelah‐Spencer graphs, Random amenable C*-algebras, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Indivisible sets and well‐founded orientations of the Rado graph, Which subsets of an infinite random graph look random?, Weak Fraisse categories, Minimal asymmetric hypergraphs, Infinite Ramsey-minimal graphs for star forests, Two-step nilpotent extensions are not anabelian, Binary Linear Codes with Near-Extremal Maximum Distance, Maximal asymmetry of graphs, Orbits on \(n\)-tuples for infinite permutation groups, Parker vectors for infinite groups, Unnamed Item, A family of \(m\)-ovoids of parabolic quadrics, Infinite families of asymmetric graphs, Infinite Paley graphs, Unnamed Item, Generating Infinite Random Graphs, Triply Existentially Complete Triangle‐Free Graphs, Distinguishing numbers of finite 4-valent vertex-transitive graphs, Local dissymmetry on graphs and related algebraic structures, Limit laws and automorphism groups of random nonrigid structures, Some classifications of graphs with respect to a set adjacency relation, Almost Every Domain is Universal, Asymmetric and symmetric graphs
Cites Work
