Long paths in heterogeneous random subgraphs of graphs with large minimum degree

DOI10.1016/j.ipl.2023.106401MaRDI QIDQ6161461

Yilun Shang

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

random graphscombinatorial problemspathHamiltonian pathsubgraph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on an inequality involving the normal distribution
• The longest path in a random graph
• Paths and cycles in random subgraphs of graphs with large minimum degree
• A scaling limit for the length of the longest cycle in a sparse random graph
• Random perturbation of sparse graphs
• On the tree-depth and tree-width in heterogeneous random graphs
• Extremal paths in inhomogenous random graphs
• Long cycles in locally expanding graphs, with applications
• On the Hamiltonicity of random bipartite graphs
• Introduction to Random Graphs
• Long paths and cycles in random subgraphs of graphs with large minimum degree
• Crux and Long Cycles in Graphs
• Long cycles in random subgraphs of graphs with large minimum degree
• The Threshold Probability for Long Cycles
• Random Graphs
• On connectivity and robustness of random graphs with inhomogeneity
• Cycle lengths in sparse random graphs

This page was built for publication: Long paths in heterogeneous random subgraphs of graphs with large minimum degree