Asymmetric graphs
From MaRDI portal
Publication:5728982
DOI10.1007/BF01895716zbMATH Open0118.18901OpenAlexW4248209491WikidataQ56853021 ScholiaQ56853021MaRDI QIDQ5728982FDOQ5728982
Authors: Alfréd Rényi, P. Erdős 
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
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- Homogeneous actions on the random graph
- Limit laws and automorphism groups of random nonrigid structures
- Almost all graphs are rigid-revisited
- Maximal chains of isomorphic subgraphs of the Rado graph
- Orbits on \(n\)-tuples for infinite permutation groups
- Deeply asymmetric planar graphs
- On graphs isomorphic to their neighbour and non-neighbour sets
- Binary Covering Arrays and Existentially Closed Graphs
- Endomorphism breaking in graphs
- Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures
- Distanced graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- On the exact maximum induced density of almost all graphs and their inducibility
- Asymmetrising sets in trees
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- Finite-model theory -- A personal perspective
- The capture time of a graph
- Random Permutations: Some Group-Theoretic Aspects
- Neostability in countable homogeneous metric spaces
- The poset of all copies of the random graph has the 2-localization property
- Extending partial isomorphisms of graphs
- Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds
- Generalisations of hypomorphisms and reconstruction of hypergraphs
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
- On random relational structures
- Some sequences of integers
- Random quantum graphs
- Either tournaments or algebras?
- Largest non-unique subgraphs
- On compact symmetric regularizations of graphs
- On symmetry of uniform and preferential attachment graphs
- Existentially closed graphs via permutation polynomials over finite fields
- Graph of a nearring with respect to an ideal.
- Binary linear codes with near-extremal maximum distance
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Further results on existentially closed graphs arising from block designs
- Cohomological aspects of two-graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Distance-regular Cayley graphs over dicyclic groups
- Limited visibility cops and robber
- Almost all graphs are rigid - Revisited
- Triply existentially complete triangle-free graphs
- Homogeneous Cayley objects
- Fighting constrained fires in graphs
- Vertex nomination schemes for membership prediction
- Distinguishing graphs by edge-colourings
- On the minimum order of graphs with given semigroup
- A family of \(m\)-ovoids of parabolic quadrics
- Universal homogeneous causal sets
- A surprising permanence of old motivations (a not-so-rigid story)
- Typical automorphism groups of finite nonrigid structures
- Cyclic automorphisms of a countable graph and random sum-free sets
- Minimal asymmetric graphs of induced length 4
- Counting and coding identity trees with fixed diameter and bounded degree
- The age of a relational structure
- Structural Ramsey theory of metric spaces and topological dynamics of isometry groups
- Copies of the random graph
- Reversibility of extreme relational structures
- Asymptotics of symmetry in matroids
- Infinite random geometric graphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Detecting almost symmetries of graphs
- Graph isomorphism problem
- Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
- Paley and the Paley Graphs
- An explicit construction of \((3,t)\)-existentially closed graphs
- Ramsey theory for countable binary homogeneous structures
- Regular orbits of permutation groups on the power set
- Fixing subgraphs
- Deciding and verifying network properties locally with few output bits
- Classical symmetries and the quantum approximate optimization algorithm
- No additional tournaments are quasirandom-forcing
- Kolmogorov random graphs only have trivial stable colorings.
- Distinguishing numbers of finite 4-valent vertex-transitive graphs
- Minimal asymmetric graphs
- Low-degree factors of random polynomials
- The isomorphism problem of trees from the viewpoint of Terwilliger algebras
- Ample simplicial complexes
- Restrained domination in self-complementary graphs
- The Rado simplicial complex
- Finite big Ramsey degrees in universal structures
- Homogeneous and ultrahomogeneous linear spaces
- Switching with more than two colours.
- Maximal asymmetry of graphs
- On strongly asymmetric graphs
- Asymmetric and symmetric graphs
- Fraïssé limits in comma categories
- Bipartite graph embeddings, Riemann surfaces and Galois groups
- Random generations of the countable random graph
- Pairings and related symmetry notions
- Infinite families of asymmetric graphs
- Statistical graph space analysis
- Infinite Paley graphs
- Simplicial complexes and closure systems induced by indistinguishability relations
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Almost equitable partitions and new necessary conditions for network controllability
- Distinguishing graphs of maximum valence 3
- A unified approach to structural limits and limits of graphs with bounded tree-depth
This page was built for publication: Asymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5728982)
