On the existence of a factor of degree one of a connected random graph
From MaRDI portal
Publication:5603846
DOI10.1007/BF01894879zbMath0203.56902OpenAlexW2111559003WikidataQ105917781 ScholiaQ105917781MaRDI QIDQ5603846
Publication date: 1966
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01894879
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs, A hybrid routing model for mitigating congestion in networks, From time series to complex networks: the phase space coarse graining, The number of trees with a 1-factor, On large matchings and cycles in sparse random graphs, Elegantly Colored Paths and Cycles in Edge Colored Random Graphs, On spanning structures in random hypergraphs, Diffusion in large networks, Degree distributions and motif profiles of limited penetrable horizontal visibility graphs, Edge-colouring random graphs, On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm, Threshold Functions for H-factors, Graph factors and factorization: 1985--2003: a survey, Perfect fractional matchings in \(k\)-out hypergraphs, Global dynamics of an epidemic model with incomplete recovery in a complex network, The global resilience of Hamiltonicity in \(G(n, p)\), Spanning structures and universality in sparse hypergraphs, Packing tree factors in random and pseudo-random graphs, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Embedding spanning bounded degree subgraphs in randomly perturbed graphs, On the chromatic number in the stochastic block model, The birth of the strong components, Cycle Factors and Renewal Theory, Small maximal matchings in random graphs., Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, On the complexity of the herding attack and some related attacks on hash functions, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Threshold for Steiner triple systems, Perfect matchings in random intersection graphs, On factors in random graphs, Asymptotics for Shamir's problem, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, On the combinatorial problems which I would most like to see solved, Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes, Combinatorial and computational aspects of graph packing and graph decomposition, Perfect Matchings in Random r-regular, s-uniform Hypergraphs, One-factor in random graphs based on vertex choice, The cook-book approach to the differential equation method, Exact and asymptotic results on coarse Ricci curvature of graphs, Perfect matchings and Hamiltonian cycles in the preferential attachment model, \(H(n)\)-factors in random graphs, Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids, Matching theory -- a sampler: From Dénes König to the present, Matching and covering the vertices of a random graph by copies of a given graph, Hamiltonian circuits in random graphs, Integer sets with prescribed pairwise differences being distinct, Unnamed Item, Random perturbation of sparse graphs, Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs, Random graph's Hamiltonicity is strongly tied to its minimum degree, Tilings in Randomly Perturbed Dense Graphs, The Kőnig graph process, Nonvertex‐Balanced Factors in Random Graphs, Increasing the flexibility of the herding attack, On Hamilton-cycles of random graphs, Unnamed Item, Optimal threshold for a random graph to be 2-universal, Karp–Sipser on Random Graphs with a Fixed Degree Sequence, VIRTUALLY FIBERING RIGHT-ANGLED COXETER GROUPS, Hitting times for Shamir’s problem
Cites Work
