A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
From MaRDI portal
Publication:6052468
DOI10.1002/rsa.21058zbMath1522.05444OpenAlexW3214418985WikidataQ113913007 ScholiaQ113913007MaRDI QIDQ6052468
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.21058
random graphJacobson's conjectureirregularity strength of a graphFaudree-Lehel conjectureirregular edge weighting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- Decomposing graphs into a constant number of locally irregular subgraphs
- Irregularity strength of regular graphs of large degree
- An iterative approach to graph irregularity strength
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- On the number of irregular assignments on a graph
- Irregularity strength of trees
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- The irregularity strength and cost of the union of cliques
- Irregularity strength and compound graphs
- On decomposing regular graphs into locally irregular subgraphs
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Highly irregular graphs
- Irregular Assignments of Trees and Forests
- On the irregularity strength of them ×n grid
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- How to make a random graph irregular
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Irregularity strength of dense graphs
- Graph colouring and the probabilistic method
This page was built for publication: A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
