Problems and results in combinatorial analysis and graph theory
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
A variable order Runge-Kutta method for initial value problems with rapidly varying right-hand sides
ACM Transactions on Mathematical Software (TOMS)
Induced matchings in bipartite graphs
Discrete Mathematics - In memory of Tory Parsons
Discrete Mathematics
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
Maximum induced matchings in graphs
Discrete Mathematics
Maximum matchings in sparse random graphs: Karp-Sipser revisited
Random Structures & Algorithms
Numerical Initial Value Problems in Ordinary Differential Equations
Numerical Initial Value Problems in Ordinary Differential Equations
Maximum induced matchings of random cubic graphs
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Maximum Induced Matchings of Random Cubic Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Large k-separated matchings of random regular graphs
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
Maximum induced matchings of random regular graphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
| Hi-index | 0.00 |
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense). We consider the problem of approximating the solution to the maximum k-separated matching problem in random r-regular graphs for each fixed integer k and each fixed r 驴 3. We prove both constructive lower bounds and combinatorial upper bounds on the size of the optimal solutions.