scientific article

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity matching cycles extremal graphs diameter packing connectivity extremal problems colourings complete subgraphs extremal graph theory Turan topological subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items

Embedding graphs of small size, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, On the contractibility of a digraph onto $K_ 4^*$, A $k$-structure generalization of the theory of 2-structures, On induced subgraphs with odd degrees, On the complexity of finite subgraphs of the curve graph, Independent cycles with limited size in a graph, The decision-tree complexity of element distinctness, $k$-connectivity and decomposition of graphs into forests, Problems and results in discrete mathematics, On a matrix partition conjecture, Fractional v. integral covers in hypergraphs of bounded edge size, The structure of quasi 4-connected graphs, The colour theorems of Brooks and Gallai extended, A note on packing of three forests, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, Dirac's conjecture on $K_ 5$-subdivisions, Stage-graph representations, The VC-dimension of set systems defined by graphs, Uniquely total colorable graphs, Tournaments as strong subcontractions, Independent transversals in $r$-partite graphs, Combinatorial aspects of geometric graphs, Finding modes with equality comparisons, Planar stage graphs: Characterizations and applications, Maximizing the number of independent sets of fixed size in connected graphs with given independence number, Distance colouring without one cycle length, The minimum number of triangles in graphs of given order and size, Handsome proof-nets: Perfect matchings and cographs, 2-connected graphs with small 2-connected dominating sets., The size of bipartite graphs with a given girth, Topological minors in graphs of large girth, Packing closed trails into dense graphs., Ramsey numbers involving large dense graphs and bipartite Turán numbers, Graphs with large maximum degree containing no odd cycles of a given length, On completely positive graphs and their complements, Covering vertices of a graph by $k$ disjoint cycles, The smallest degree sum that yields potentially $_{k}C_{\ell}$-graphic sequences, On the monotonicity of games generated by symmetric submodular functions., Hereditary systems and greedy-type algorithms., Disjoint cliques in claw-free graphs, Problems and results in extremal combinatorics. I., Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, Packing of graphs and permutations -- a survey, Vertex-symmetric generalized Moore graphs., A note on the ``packing of two copies of some trees into their third power, On maximum $k$-edge-colorable subgraphs of bipartite graphs, Reciprocal degree distance and graph properties, Reducible chains in several types of 2-connected graphs, On games of incomplete information, Asymptotic growth of sparse saturated structures is locally determined, Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties, A Turán-type theorem on chords of a convex polygon, On embedding of graphs into Euclidean spaces of small dimension, Lower bound of cyclic edge connectivity for $n$-extendability of regular graphs, Uniquely colorable graphs, Chromatic number, girth and maximal degree, Dense neighbourhoods and Turan's theorem, Set colourings of graphs, Helly families of maximal size, Radius, diameter, and minimum degree, Covering graphs: The covering problem solved, On the Ramsey problem for multicolor bipartite graphs, Packing and decomposition of graphs with trees, Circuit decompositions of Eulerian graphs, A two-person game on graphs where each player tries to encircle his opponent's men, Cycle factors in dense graphs, Polarities and $2k$-cycle-free graphs, Monadic second-order logic, graph coverings and unfoldings of transition systems, Two path extremal graphs and an application to a Ramsey-type problem, The smallest Ramsey numbers, Another cycle structure theorem for Hamiltonian graphs, Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling, Linear coloring of graphs, The number of complete subgraphs of equi-partite graphs, An extremal problem concerning graphs not containing $K_t$ and $K_{t,n-t}$, Vertex-disjoint hexagons with chords in a bipartite graph, Triangles in claw-free graphs, Toughness and the existence of $k$-factors. III, Sign-balanced covering matrices, Graph partitions with minimum degree constraints, Choosability of $K_5$-minor-free graphs, Defining sets and uniqueness in graph colorings: A survey, Induced subgraphs of given sizes, Edge-disjoint spanners of complete graphs and complete digraphs, On quadrilaterals in a graph, Optimal factorizations of families of trees, On the maximum number of independent cycles in a graph, Every $H$-decomposition of $K_n$ has a nearly resolvable alternative, Subdivisions of transitive tournaments, Norm-graphs: Variations and applications, Mutual placement of bipartite graphs, Local majorities, coalitions and monopolies in graphs: A review, Superconcentrators of depths 2 and 3; odd levels help (rarely), Minors of quasi 4-connected graphs, Intersecting designs from linear programming and graphs of diameter two, Subdivision thresholds for two classes of graphs, On induced subgraphs of trees, with restricted degrees, Acyclic edge-colorings of sparse graphs, Wavelength routing in optical networks of diameter two, Disjointly representing set systems, The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions., On finding common neighborhoods in massive graphs., The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs, Spectral extremal graphs for intersecting cliques, Stability theorems for cancellative hypergraphs, Geometric graphs with no self-intersecting path of length three, A variation of a classical Turán-type extremal problem, Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs, The number of edge-disjoint transitive triples in a tournament, Broadcast time and connectivity, On-line generalized Steiner problem, On the strength of comparisons in property testing, Spectral radius, edge-disjoint cycles and cycles of the same length, On the maximum density of 0-1 matrices with no forbidden rectangles, The spectral radius of graphs with no intersecting odd cycles, Tough Ramsey graphs without short cycles, Extremal graphs of the $p$th power of paths, Explicit construction of graphs with an arbitrary large girth and of large size, Turán number of disjoint triangles in 4-partite graphs, Greedy clique decompositions and the Turán numbers, The isomorphic factorization of complete tripartite graphs $K(m,n,s)$.--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure, A note on packing of uniform hypergraphs, On independent cycles and edges in graphs, The number of copies of $K_{2,t+1}$ in a graph, On the distortion required for embedding finite metric spaces into normed spaces, Cycle-saturated graphs of minimum size, Large $2P_ 3$-free graphs with bounded degree, Extremal functions for sequences, Packing three trees, 2-factors in dense graphs, Zero-sum problems -- a survey, The number of complements of a topology on $n$ points is at least $2^ n$ (except for some special cases), Weak saturation numbers of $K_{2, t}$ and $K_p \bigcup K_q$, A characterization of the components of the graphs $D(k,q)$, Packing a number of copies of a $( p , q )$-graph, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Maximising the number of cycles in graphs with forbidden subgraphs, Turán and Ramsey numbers in linear triple systems, Matrix rigidity, Minimizing the numbers of cliques and cycles of fixed size in an $F$-saturated graph, Intersecting designs, On the (signless Laplacian) spectral radius of minimally $k$-(edge)-connected graphs for small $k$, Minimizing the number of edges in $\mathcal{C}_{\geq r} $-saturated graphs, Complexity of stability, Spectral radius and $k$-connectedness of a graph, Packing three copies of a tree into its sixth power, Covering a graph with cycles of length at least 4, Analytic methods for uniform hypergraphs, Optimal graphs for independence and $k$-independence polynomials, Upper bound on distance in the pants complex, A $2^{O(k)}n$ algorithm for $k$-cycle in minor-closed graph families, On self-complementary supergraphs of ($n,n$)-graphs, The signless Laplacian spectral radius of graphs with no intersecting triangles, Extremal infinite graph theory, Sparse graph certificates for mixed connectivity, Matroidal bijections between graphs, Posets with maximal Möbius function, A note on Turán's theorem, Wiener index, Harary index and graph properties, Steiner diameter, maximum degree and size of a graph, Approximate Moore graphs are good expanders, Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs, On graph fall-coloring: existence and constructions, Cut and pendant vertices and the number of connected induced subgraphs of a graph, The number of distinct subset sums of a finite set of vectors, Orthogonal decomposition and packing of complete graphs, Another extremal property of some Turán graphs, An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees, Monochromatic square-cycle and square-path partitions, An upper bound on the Ramsey number of trees, On a problem of potentially pancyclic-graphic sequences due to S.B. Rao, Packing of graphs - a survey, The number of graphs without forbidden subgraphs, Quadrangulations and 4-color-critical graphs, A new Turán-type theorem for cliques in graphs, Superfluous edges and exponential expansions of de Bruijn and Kautz graphs, Lower bounds on the independence number in terms of the degrees, Some remarks on packing trees, Regular $K_n$-free graphs, Constraints for symmetry breaking in graph representation, Characterizations of matroids with an element lying in a restricted number of circuits, Maximum size of a graph with given fractional matching number, Turán and Ramsey numbers in linear triple systems. II, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles, On generalized Ramsey theory: The bipartite case, Some results related to the evasiveness conjecture., The extremal function for complete minors, Fragmentability of graphs, Covering non-uniform hypergraphs, Odd wheels in graphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, Singularities in the entropy of asymptotically large simple graphs, Results and problems on chorded cycles: a survey, A characterization of the non-trivial diameter two graphs of minimum size, Tree-core and tree-coritivity of graphs, Almost-spanning subgraphs with bounded degree in dense graphs, Bounds for the rainbow disconnection numbers of graphs, The extremal sizes of arc-maximal $(k, \ell)$-digraphs, Directed virtual path layouts in ATM networks, Counting ordered graphs that avoid certain subgraphs, A remark on matrix rigidity, The NIP graph of a social welfare function, Probabilistic analysis of upper bounds for 2-connected distance $k$-dominating sets in graphs, Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent $| Rho$- Tau$|$. (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges and the totally ordered pairs which maximize $| Rho$- Tau$|)$, On the diameter of separated point sets with many nearly equal distances, Uniquely forced perfect matching and unique 3-edge-coloring, Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, An improved bound for the monochromatic cycle partition number, Extremal results for random discrete structures, Packing directed cycles efficiently, Spectral radii of graphs with given chromatic number, Graph factors and factorization: 1985--2003: a survey, Cubic maximal nontraceable graphs, Packing of two digraphs into a transitive tournament, On some extremal connectivity results for graphs and matroids, Eigenvalues and forbidden subgraphs. I., Pancyclic properties of the graph of some 0-1 polyhedra, Regular subgraphs of almost regular graphs, New exact values of the maximum size of graphs free of topological complete subgraphs, Minimum degree and the minimum size of $K_2^t$-saturated graphs, Topological cliques of random graphs, Optimal fault-tolerant routings with small routing tables for $k$-connected graphs, Graphs without minor complete subgraphs, A new class of Ramsey-Turán problems, Large joints in graphs, On a conjecture on the balanced decomposition number, Distant irregularity strength of graphs, Exact solution of the hypergraph Turán problem for $k$-uniform linear paths, Forcing $k$-repetitions in degree sequences, Extremal problems for the $p$-spectral radius of graphs, Perfect matchings in 4-uniform hypergraphs, Super cyclically edge connected transitive graphs, Maximizing the spectral radius of $k$-connected graphs with given diameter, Locally bounded coverings and factorial properties of graphs, On extremal graphs with at most $\ell$ internally disjoint Steiner trees connecting any $n-1$ vertices, Low-distortion embeddings of graphs with large girth, Forbidden subgraphs in the norm graph, A data structure useful for finding Hamiltonian cycles, Completing partial packings of bipartite graphs, Implicit-degrees and circumferences, Unique graph homomorphisms onto odd cycles. II, Combinatorial and computational aspects of graph packing and graph decomposition, Cycle bases in graphs characterization, algorithms, complexity, and applications, Edge reductions in cyclically $k$-connected cubic graphs, Tournaments with near-linear transitive subsets, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, On the minimum degree forcing $F$-free graphs to be (nearly) bipartite, The maximum edit distance from hereditary graph properties, Regular graphs of large girth and arbitrary degree, New bounds on $\bar{2}$-separable codes of length 2, Lower bounds for independence numbers of some locally sparse graphs, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, On embedding well-separable graphs, Disjoint unions of complete minors, Generalizing vertex pancyclic and $k$-ordered graphs, On saturation games, Monochromatic bounded degree subgraph partitions, Independent sets in graphs, Extremality of degree-based graph entropies, Near packings of two graphs, The total chromatic number of graphs having large maximum degree, Excluding induced subgraphs. II: Extremal graphs, On the calculation of transitive reduction-closure of orders, Bounded vertex colorings of graphs, Query strategies for priced information, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, On the complexity of fixed parameter clique and dominating set, Vertex-disjoint quadrilaterals in graphs, Girth and treewidth, Approximating $k$-spanner problems for $k>2$, On the Ramsey numbers for stars versus complete graphs, Locally finite graphs with ends: A topological approach. II: Applications, The binding number of a graph and its pancyclism, Optimal parallel algorithms on planar graphs, The $(k,\ell )$-proper index of graphs, Diameter graphs in ${\mathbb R}^4$, On an extremal hypergraph problem related to combinatorial batch codes, The Turán number of sparse spanning graphs, More on the power of chain rules in context-free grammars, The structure of social decision functions, Two conditions for reducing the maximal length of node-disjoint paths in hypercubes, Stability results on the circumference of a graph, Recent trends in combinatorial optimization, Combinatorial dimension and random sets, Lower bounds for the clique and the chromatic numbers of a graph, An edge extremal result for subcohesion, Graph decompositions without isolates, Girth in graphs, A generalization of the Bondy-Chvátal theorem on the k-closure, Embedding of $\ell^ k_{\infty}$ in finite dimensional Banach spaces, Geometrical solution of an intersection problem for two hypergraphs, The behaviour of (n over $k,\dots ,k,n-ik)c^ i/i!$ is asymptotically normal, How to make a graph bipartite, Extremal problems whose solutions are the blowups of the small Witt- designs, New lower bound techniques for distributed leader finding and other problems on rings of processors, The structure of the models of decidable monadic theories of graphs, Low dimensional embeddings of doubling metrics, Decomposing oriented graphs into transitive tournaments, Time-space trade-offs for branching programs, The complexity of colouring problems on dense graphs, Minimally 3-connected graphs, The average size of an independent set in graphs with a given chromatic number, Maximum induced trees in graphs, Sufficient conditions for maximally connected dense graphs, Counterexample to a conjecture on Hamilton cycles, On lattices with Möbius function $\pm 1,0$, Extremal problems concerning transformations of the set of edges of the complete graph, Two theorems on packings of graphs, Edge-connectivity augmentation problems, Inequalities relating degrees of adjacent vertices to the average degree, What can we hope to accomplish in generalized Ramsey theory ?, Another extremal problem for Turan graphs, Local $k$-colorings of graphs and hypergraphs, The binding number of a graph and its triangle, The connectivities of adjacent tree graphs, A lower bound on connectivities of matroid base graphs, On common edges in optimal solutions to traveling salesman and other optimization problems, Intersection properties of boxes. I: An upper-bound theorem, The number of triangles in a $K_ 4$-free graph, Exact solution of some Turán-type problems, Simplicial decompositions of graphs: A survey of applications, Triad count statistics, Efficient approximate solution of sparse linear systems, The Erdős-Jacobson-Lehel conjecture on potentially $P_k$-graphic sequence is true, Efficient algorithms for a mixed $k$-partition problem of graphs without specifying bases, On graphs with equal edge connectivity and minimum degree, The distribution of the maximum degree of a random graph, Girth, valency, and excess, Ramsey numbers for matchings, Degree sequences of random graphs, Hadwiger's conjecture is true for almost every graph, Sorting in one round, The size of connected hypergraphs with prescribed covering number, Critically partitionable graphs. II, Equitable and proportional coloring of trees, On finite Ramsey numbers, The maximal size of graphs with at most $k$ edge-disjoint paths connecting any two adjacent vertices, Biased graphs. II: The three matroids, Constructing the relative neighborhood graph in 3-dimensional Euclidean space, Lower bounds on the stability number of graphs computed in terms of degrees, Extremal graphs with no $C^{4,}$s, $C^{6,}$s, or $C^{10,}$s, The chromatic uniqueness of complete bipartite graphs, Long cycles in subgraphs with prescribed minimum degree, Saturated $r$-uniform hypergraphs, On some factor theorems of graphs, Perfect matching for regular graphs is $AC^ 0$-hard for the general matching problem, Planar Ramsey numbers for cycles, Problems and results in extremal combinatorics. II, Edge-colorings avoiding rainbow and monochromatic subgraphs, $L_ 1$ shortest paths among polygonal obstacles in the plane, Generalized local colorings of graphs, Counting and cutting cycles of lines and rods in space, On 2-factors with $k$ components, Davenport-Schinzel theory of matrices, Bounds on the number of complete subgraphs, On sparse spanners of weighted graphs, New results for finding common neighborhoods in massive graphs in the data stream model, On small graphs with highly imperfect powers, Matching theory -- a sampler: From Dénes König to the present, Turán theorems with repeated degrees, Graphs with small diameter after edge deletion, Examples of products giving large graphs with given degree and diameter, Tight embeddings of partial quadrilateral packings, Graphs with the maximum or minimum number of 1-factors, Large induced subgraphs with equated maximum degree, Hamilton-chain saturated hypergraphs, Recent developments on graphs of bounded clique-width, Degree conditions on distance 2 vertices that imply $k$-ordered Hamiltonian, Packing edge-disjoint cycles in graphs and the cyclomatic number, On disjoint matchings in cubic graphs, Sharp bounds for the generalized connectivity $\kappa _{3}(G)$, Finding bipartite subgraphs efficiently, Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Some three-color Ramsey numbers, $R(P_4,P_5,C_k)$ and $R(P_4,P_6,C_k)$, On the homogeneous algebraic graphs of large girth and their applications, Unit distances and diameters in Euclidean spaces, Factor-critical graphs with given number of maximum matchings, Combinatorial designs and the theorem of Weil on multiplicative character sums, Large disjoint subgraphs with the same order and size, Constructions of bi-regular cages, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Calculating the extremal number $ex(v;\{C_3,C_4,\dots,C_n\})$, Extension problems with degree bounds, Minimum cuts, girth and a spectral threshold, Hardness of edge-modification problems, On cyclic edge-connectivity of transitive graphs, Stability of the path-path Ramsey number, Ordered colourings of graphs, On the maximum density of graphs which have no subcontraction to $K^ r$., A note on the probabilistic approach to Turan's problem, Minimally k-connected graphs of low order and maximal size, On color critical graphs, Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph, An extremal problem for sets with applications to graph theory, Every poset has a central element, Factors of regular graphs, Separating pairs of points of standard boxes, A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set, Dense graphs are antimagic, Mutually complementary partial orders, Tripartite Ramsey numbers for paths, Construction of a family of graphs with a small induced proper subgraph with minimum degree 3, Factors and factorizations of graphs—a survey, Monochromatic cycle power partitions, Spanning trails with variations of Chvátal-Erdős conditions, An extremal problem in subconnectivity, Unnamed Item, Do 3n − 5 edges force a subdivision ofK5?, New length bounds for cycle bases, Upper bounds for harmonious colorings, A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation, The smallest number of edges in a 2-connected graph with specified diameter, Some corollaries of a theorem of Whitney on the chromatic polynomial, Dependence polynomials, New results on the Zarankiewicz problem, Super-cyclically edge-connected regular graphs, Disjoint cycles in graphs with distance degree sum conditions, Counting results for sparse pseudorandom hypergraphs. I., Counting results for sparse pseudorandom hypergraphs. II., Stability for vertex cycle covers, The monochromatic connectivity of graphs, Embedding of graphs in two-irregular graphs, On minimally 2-connected graphs with generalized connectivity $\kappa_3=2$, Coloring Clique-free Graphs in Linear Expected Time, Some upper bounds on the total and list chromatic numbers of multigraphs, Scattering number in graphs, The number of 4-cycles in a graph, Graphs with large maximum degree containing no edge-critical graphs, Degree-constrained 2-partitions of graphs, A measure theoretic perspective on the space of Feynman diagrams, Message-optimal protocols for Byzantine Agreement, On sufficient conditions for rainbow cycles in edge-colored graphs, On a conjecture of spectral extremal problems, w -Rabin numbers and strong w -Rabin numbers of folded hypercubes, Spectral extremal graphs for disjoint cliques, On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition, On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications, On extremal $k$-outconnected graphs, On sets of integers whose shifted products are powers, Property testing on $k$-vertex-connectivity of graphs, Stability of Woodall's theorem and spectral conditions for large cycles, Odd cycles and $\Theta$-cycles in hypergraphs, Counting substructures and eigenvalues. I: Triangles, The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree, Disjoint long cycles in a graph, On the key expansion of $D(n, K)$-based cryptographical algorithm, The implementation of cubic public keys based on a new family of algebraic graphs, On LDPC codes corresponding to affine parts of generalized polygons, Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, Unnamed Item, Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics, Graphs and degree sequences. I, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A reduction method to find spanning Eulerian subgraphs, Graphs with unavoidable subgraphs with large degrees, Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, Cycles and stability, Packing $d$-degenerate graphs, Lower bounds on the number of triangles in a graph, Graph spanners, A spectral condition for odd cycles in graphs, Graphs without four-cycles, On bags and bugs, Characterizing minimally $n$-extendable bipartite graphs, Shifted products that are coprime pure powers, Nearly equal distances and Szemerédi's regularity lemma, A survey on labeling graphs with a condition at distance two, Set colourings of graphs. (Reprint), Extremal problems in graph theory, A unified framework for off-line permutation routing in parallel networks, Degree sequences of monocore graphs, Linear trees in uniform hypergraphs, On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups, Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>-free bipartite graphs, $k$ disjoint cycles containing specified independent vertices, Distance-Based Clique Relaxations in Networks: s-Clique and s-Club, Interactive Communication, Diagnosis and Error Control in Networks, Synchronous Rendezvous for Location-Aware Agents, The Entropy of Random-Free Graphons and Properties, Asymptotically optimal $K_k$-packings of dense graphs via fractional $K_k$-decompositions, Strong Rabin numbers of folded hypercubes, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, The recognizability of sets of graphs is a robust property, Regular graphs whose subgraphs tend to be acyclic, Shortest‐path metric approximation for random subgraphs, Large planar subgraphs in dense graphs, Pentagons and cycle coverings, Asymptotically large ($\Delta,D$)-graphs, A hierarchy of randomness for graphs, On graph problems in a semi-streaming model, Extremal connectivity for topological cliques in bipartite graphs, Improved lower bounds on the randomized complexity of graph properties, On partitions of a rectangle into rectangles with restricted number of cross sections, Some results on placing bipartite graphs of maximum degree two, Hamiltonian Chains in Hypergraphs, On extremal bipartite graphs with high girth, Cycle partitions of regular graphs, Better algorithms for minimum weight vertex-connectivity problems, Connected Graphs with Maximal Graovac-Ghorbani Index, The decomposition threshold for bipartite graphs with minimum degree one, A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs, Generating sparse spanners for weighted graphs, Regular-factors in the complements of partial k-trees, Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles), Sufficient conditions for equality of connectivity and minimum degree of a graph, Unnamed Item, ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE, The first zagreb index and some hamiltonian properties of the line graph of a graph, Embedding with a Lipschitz function, Maximizing Line Subgraphs of Diameter at Most t, A Hierarchy of Lower Bounds for Sublinear Additive Spanners, A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs, Steiner 4-diameter, maximum degree and size of a graph, On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs, The complexity of graph connectivity, Eigenvalues and cycles of consecutive lengths, Refinement on Spectral Turán’s Theorem, Placing two edge-disjoint copies of a tree into a bipartite graph, VC-dimensions for graphs (extended abstract), Achromatic arboricity on complete graphs, On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell, A note on 3‐partite graphs without 4‐cycles, Turán numbers and anti-Ramsey numbers for short cycles in complete $3$-partite graphs, Resolution of the Erdős–Sauer problem on regular subgraphs, On the Turán number of $K_m \vee C_{2k-1}$, Efficient algorithms for a mixed k-partition problem of graphs without specifying bases, New approximation results on graph matching and related problems, Dirac-type conditions for spanning bounded-degree hypertrees, A spectral extremal problem on non-bipartite triangle-free graphs, Online Spanners in Metric Spaces, Graphs of large chromatic number, Unnamed Item, Using Brouwer’s Fixed Point Theorem, Unnamed Item, On the Maximum Number of Spanning Copies of an Orientation in a Tournament, The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model, Finding even cycles even faster, Unnamed Item, The Hamilton circuit problem on grids, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, Extremal non-bipartite regular graphs of girth 4, Some new results on distance-based graph invariants, The lattice of integral flows and the lattice of integral cuts on a finite graph, Minimum vertex‐diameter‐2‐critical graphs, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, Optimal shooting: Characterizations and applications, Graphbots: Mobility in discrete spaces, Approximating k-set cover and complementary graph coloring, On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2, LDPC Codes Based on Algebraic Graphs, On triangle-free random graphs, Paul Erdős, 1913-1996, Disjoint triangles and quadrilaterals in a graph, On the elusiveness of Hamiltonian property, Contributions to the problem of Zrankiewicz, The penultimate rate of growth for graph properties, A connection between coding theory and polarized partition relations, Integer and fractional packing of families of graphs, On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph, Onk-ordered graphs, Testing graphs for colorability properties*, On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, On the Turán number of ordered forests, On the Turán number of ordered forests, Extremal graphs in connectivity augmentation, Acyclic graph coloring and the complexity of the star chromatic number, N‐extendability of symmetric graphs, Proof of a conjecture on cycles in a bipartite graph, Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs, David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware, Decomposing large graphs with small graphs of high density, Distance Colouring Without One Cycle Length, Onk-ordered Hamiltonian graphs, Rupture degree of graphs, Edge-superconnectivity of cages, Local embeddings of metric spaces, On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós, Extensions of the Erdős–Gallai theorem and Luo’s theorem, Zero-sum bipartite Ramsey numbers, On the size of maximally non-hamiltonian digraphs, Degree Conditions for Embedding Trees, Generalized Rotation numbers, Light Spanners, Distributed near-optimal matching, Maximal antiramsey graphs and the strong chromatic number, A note on a conjecture about cycles with many incident chords, New upper bounds for the greatest number of proper colorings of a (V,E)‐graph, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, Unnamed Item, Unnamed Item, Large deviations for sums of partly dependent random variables, Unnamed Item, On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree, Right Angle Crossing Drawings of Graphs, Unnamed Item, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, Ordering $Q$-indices of graphs: given size and circumference, Spectral extremal graphs for the bowtie, Turán numbers for disjoint paths, A stability result for girth‐regular graphs with even girth, On the $\alpha$-index of minimally 2-connected graphs with given order or size, Partial Shuffles by Lazy Swaps, Complexity of Stability., Independent triangles covering given vertices of a graph, The communication complexity of enumeration, elimination, and selection, Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Atoms of cyclic edge connectivity in regular graphs, On zero-sum and almost zero-sum subgraphs over $\mathbb Z$, Extremal bounds for bootstrap percolation in the hypercube