A remark on the existence of finite graphs
From MaRDI portal
Publication:3230887
DOI10.21136/cpm.1955.108220zbMath0068.37202OpenAlexW3041685368MaRDI QIDQ3230887
Publication date: 1955
Full work available at URL: http://dml.cz/handle/10338.dmlcz/108220
Related Items
A note on a theorem of Erdős and Gallai, On degree sequences of undirected, directed, and bidirected graphs, Forman-Ricci curvature and persistent homology of unweighted complex networks, Unnamed Item, Exactly scale-free scale-free networks, Graph realizations constrained by skeleton graphs, Improving the characterization of P-stability for applications in network privacy, An extremal problem on bigraphic pairs with an \(A\)-connected realization, On degree sequences and eccentricities in pseudoline arrangement graphs, Colour degree matrices of graphs with at most one cycle, Extremal problems for chromatic neighborhood sets, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, Realizability and uniqueness in graphs, Graphical sequences of some family of induced subgraphs, Leaf realization problem, caterpillar graphs and prefix normal words, On an extremal inverse problem in graph theory, Vertex-weighted graphs: realizable and unrealizable domains, I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark, On existence of hypergraphs with prescribed edge degree profile, On the least size of a graph with a given degree set, Graphs with the strong Havel-Hakimi property, Some more updates on an annihilation number conjecture: pros and cons, Validation of community robustness, Minimum degree conditions for the strength and bandwidth of graphs, Nontraceable detour graphs, Pruning the search tree in the constructive enumeration of molecular graphs, Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization, On certain trees with the same degree sequence, A short proof of a theorem on degree sets of graphs, Independence number of graphs and line graphs of trees by means of omega invariant, Extremal values of the chromatic number for a given degree sequence, Rounding in symmetric matrices and undirected graphs, A note on the characterization of digraphic sequences, Game theoretical modelling of a dynamically evolving network. II: Target sequences of score 1, Neighborhood degree lists of graphs, On vertex-weighted realizations of acyclic and general graphs, On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence, New results on degree sequences of uniform hypergraphs, Game theoretical modelling of a dynamically evolving network. I: General target sequences, On fractional realizations of graph degree sequences, Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps, Characterization of Digraphic Sequences with Strongly Connected Realizations, The complexity of degree anonymization by vertex addition, Worst-case versus average-case design for estimation from partial pairwise comparisons, Generalized Lucas graphs, Spiders can be recognized by counting their legs, On vertex-weighted graph realizations, An algorithm to generate tournament score sequences, Exact and approximate results on the least size of a graph with a given degree set, Degree sequences and graphs with disjoint spanning trees, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, A survey of discrete methods in (algebraic) statistics for networks, On the existence of super edge-connected graphs with prescribed degrees, A polynomial time algorithm to find the star chromatic index of trees, On realizations of a joint degree matrix, Graph extensions, edit number and regular graphs, An equation-free approach to coarse-graining the dynamics of networks, Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem, Extremal problems on components and loops in graphs, On null 3-hypergraphs, The mixing time of switch Markov chains: a unified approach, On matching numbers of tree and bipartite degree sequences, Generation of networks with prescribed degree-dependent clustering, Recognition of split-graphic sequences, A short constructive proof of the Erdős-Gallai characterization of graphic lists, A family of switch equivalent graphs, An intermediate value theorem for the arboricities, Graphic sequences with unique realization, Distance degree regular graphs and distance degree injective graphs: an overview, A new lower bound on the potential-Ramsey number of two graphs, Navigating between packings of graphic sequences, Sufficient degree conditions fork-edge-connectedness of a graph, Uniform Sampling of Digraphs with a Fixed Degree Sequence, The polytope of degree sequences, Eccentric sequences and eccentric sets in graphs, On the discrepancy between two Zagreb indices, Graphic sequences with a realization containing a union of cliques, Graphic sequences with a realization containing a generalized friendship graph, Degree sequence and supereulerian graphs, Vertex-weighted realizations of graphs, Graphic deviation, Construction of Hamiltonian graphs and bigraphs with prescribed degrees, A simple criterion on degree sequences of graphs, Connected realizations of joint-degree matrices, A degree sequence variant of graph Ramsey numbers, On the potential function of an arbitrary graph \(H\), A remark on degree sequences of multigraphs, Dag Realizations of Directed Degree Sequences, Properties of unique degree sequences of 3-uniform hypergraphs, Conditions for sequences to be r-graphic, Reconstructing Cactus Graphs from Shortest Path Information, Havel-Hakimi residues of unigraphs, An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem, Linear-time certifying algorithms for near-graphical sequences, The convex hull of degree sequences of signed graphs, Degree Sequences in Complexes and Hypergraphs, A lower bound on the independence number of a graph, Independence and the Havel-Hakimi residue, Relaxed and approximate graph realizations, Degree sequences and majorization, Directed Networks with a Differentially Private Bi-degree Sequence, Unnamed Item, A further result on the potential-Ramsey number of G1 and G2, A note on the potential function of an arbitrary graph H, The potential-Ramsey number of $K_n$ and $K_t^{-k}$, The set of all values of the domination number in trees with a given degree sequence, Optimization over Degree Sequences, Forcibly bipartite and acyclic (uni-)graphic sequences, Enumerating Steiner triple systems, Graph realizations: maximum degree in vertex neighborhoods, Characterization and reconstruction of hypergraphic pattern sequences, Fault-tolerant graph realizations in the congested clique, On signed degrees in signed graphs, A survey of the maximal and the minimal nullity in terms of omega invariant on graphs, Methods for the graph realization problem, Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture, Unnamed Item, Degree polynomial for vertices in a graph and its behavior under graph operations, On triangular biregular degree sequences, On unigraphic polyhedra with one vertex of degree \({p-2}\), Degree realization by bipartite multigraphs, The sequence of prime gaps is graphic, Algebraic characterization of graphical degree stability, Unnamed Item, Constructing and sampling directed graphs with given degree sequences, Efficiently Realizing Interval Sequences, A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic, Exact sampling of graphs with prescribed degree correlations, Every planar graph with nine points has a nonplanar complement, Stability of the Potential Function, The condition for a sequence to be potentially $A_{L, M}$- graphic, Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\), NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs, Majorization and the number of bipartite graphs for given vertex degrees, Realization problems on reachability sequences, Unnamed Item, The effect of edge and vertex deletion on omega invariant, Connectedness criteria for graphs by means of omega invariant
