Open problems of Paul Erd�s in graph theory
From MaRDI portal
Publication:4337503
DOI<3::AID-JGT1>3.0.CO;2-R 10.1002/(SICI)1097-0118(199705)25:1<3::AID-JGT1>3.0.CO;2-RzbMath0872.05052OpenAlexW4245585741MaRDI QIDQ4337503
Publication date: 22 July 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.0.co;2-r
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Problem books (00A07) Extremal set theory (05D05) Graph theory (05C99)
Related Items
Oscillator death in coupled functional differential equations near Hopf bifurcation, Ordering graphs with small index and its application, Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures, Complementary eigenvalues of graphs, Minimal congestion trees, Universal and unavoidable graphs, The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains, Forbidden subgraphs in connected graphs, Graphs determined by polynomial invariants, Sparse topologies with small spectrum size, On the multiplicity of Laplacian eigenvalues and Fiedler partitions, Structure modeling and estimation of multiple resolvable group targets via graph theory and multi-Bernoulli filter, Turán numbers of sunflowers, The limiting distributions of large heavy Wigner and arbitrary random matrices, A Riemannian approach to graph embedding, Error bounds of multi-graph regularized semi-supervised classification, The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels, Spectral partitioning works: planar graphs and finite element meshes, Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs, Resistance distance and the normalized Laplacian spectrum, Old and new results on algebraic connectivity of graphs, A note on the Erdős-Hajnal hypergraph Ramsey problem, Representation of functions on big data associated with directed graphs, The Erdős-Hajnal hypergraph Ramsey problem, Spread of (mis)information in social networks, Enabling scalable spectral clustering for image segmentation, The number of 4-cycles in a graph, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Hierarchical kernel spectral clustering, Weighted twin support vector machines with local information and its application, The least eigenvalue of the signless Laplacian of the complements of trees, Sketchy tweets: ten minute conjectures in graph theory, Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations, Graph theory. Abstracts from the workshop held January 2--8, 2022, Bounds for the largest \(p\)-Laplacian eigenvalue for graphs, The journey of graph kernels through two decades, Isospectral graph reductions and improved estimates of matrices' spectra, Extinction and positivity of solutions of the \(p\)-Laplacian evolution equation on networks, Expanding and forwarding parameters of product graphs, The number of \(K_{m,m}\)-free graphs, The theory of elementary landscapes, Cleaning a network with brushes, Shortest paths in distance-regular graphs, A study of graph spectra for comparing graphs and trees, Annealing and the normalized \(N\)-cut, Graph spectral image smoothing using the heat kernel, On the discrete version of Picone's identity, Spectrum of a homogeneous graph, On the mean square displacement of a random walk on a graph, Unavoidable hypergraphs, The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\), Uniform Kazhdan constant for some families of linear groups., Scalable learning and inference in Markov logic networks, Multicolour Ramsey numbers of odd cycles, Clique-inserted-graphs and spectral dynamics of clique-inserting, An efficient algorithm for attention-driven image interpretation from segments, Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics, Constraint score: A new filter method for feature selection with pairwise constraints, Towards a theoretical foundation for Laplacian-based manifold methods, Doing-it-all with bounded work and communication, Spectra of digraphs, Return probability for random walks on scale-free complex trees, Extinction and positivity of the solutions of the heat equations with absorption on networks, Measuring instance difficulty for combinatorial optimization problems, On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs, On certain connectivity properties of the internet topology, On the isoperimetric spectrum of graphs and its approximations, Electric routing and concurrent flow cutting, Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces, Spectra of generalized compositions of graphs and hierarchical networks, Spectral methods for graph clustering - a survey, Bounding the gap between extremal Laplacian eigenvalues of graphs, A Sears-type self-adjointness result for discrete magnetic Schrödinger operators, Discrete nodal domain theorems, Equality of Lifshitz and van Hove exponents on amenable Cayley graphs, Matchings in regular graphs from eigenvalues, How bad is forming your own opinion?, Sufficient conditions of endemic threshold on metapopulation networks, Local phase synchronization and clustering for the delayed phase-coupled oscillators with plastic coupling, Optimization problems for weighted graphs and related correlation estimates, Ramsey properties of randomly perturbed graphs: cliques and cycles, Discrete Green's functions, Minimal-volume shadows of cubes, Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition, General Randić matrix and general Randić incidence matrix, Intrinsic modeling of stochastic dynamical systems using empirical geometry, Ramsey Numbers for Nontrivial Berge Cycles, Spectral distances on graphs, Drawing graphs by eigenvectors: theory and practice
